Method of controlling and apparatus of receiving mobile service data

ABSTRACT

The present invention relates to a digital broadcasting system, when transmitting mobile service data. In order to do so, the present invention performs additional encoding on the mobile service data and outputs the additionally encoded data. Accordingly, robustness is provided to the mobile service data, thereby enabling the mobile service data to respond swiftly and strongly against noise and channel changes.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a block diagram showing a general structure of adigital broadcasting system according to an embodiment of the presentinvention;

FIG. 2 illustrates a block diagram of a service multiplexer shown inFIG. 1 of the present invention;

FIG. 3 illustrates a block diagram of a transmitter shown in FIG. 1 ofthe present invention;

FIG. 4 illustrates a block diagram of a pre-processor shown in FIG. 3 ofthe present invention;

FIG. 5( a) to FIG. 5( e) illustrate process steps of error correctionencoding and error detection encoding according to an embodiment of thepresent invention;

FIG. 6( a) to FIG. 6( d) illustrate process steps of row permutation insuper frame units according to an embodiment of the present invention;

FIG. 7A and FIG. 7B respectively illustrate examples of data structuresbefore and after a data deinterleaver of a digital broadcasttransmitting system according to the present invention;

FIG. 8 illustrates a part of data region A of the signal frame shown inFIG. 7A;

FIG. 9( a) to FIG. 9( c) illustrate examples a data structure(arrangement) of transmission (Tx) parameters included in a mobileservice data region as signaling data;

FIG. 10 illustrates an exemplary arrangement of the signaling data shownin FIG. 9 being inserted in a signal frame after interleaving in abroadcast transmitting system according to the present invention;

FIGS. 11( a) and 11(b) illustrate examples of acquiring mobile servicedata included in a particular data group within a burst according to thepresent invention;

FIGS. 12( a) to 12(c) illustrate other examples of acquiring mobileservice data included in a particular data group within a burstaccording to the present invention;

FIG. 13 illustrates an exemplary process of dividing an RS frame forconfiguring a data group according to an embodiment of the presentinvention;

FIG. 14( a) and FIG. 14( b) illustrate an exemplary process of dividingan RS frame for configuring a data group according to another embodimentof the present invention;

FIG. 15 illustrates exemplary operations of a packet multiplexer fortransmitting data groups according to the present invention;

FIG. 16 illustrates a block diagram showing a structure of a blockprocessor according to an embodiment of the present invention;

FIG. 17A to FIG. 17C illustrate block views showing exemplary operationsof the symbol encoder having the coding rate of ¼ according to anembodiment of the present invention;

FIG. 18A illustrates a detailed block view of a ½ outer encoderaccording to an embodiment of the present invention;

FIG. 18B illustrates a detailed block view of a ¼ outer encoderaccording to an embodiment of the present invention;

FIG. 19( a) to FIG. 19( c) illustrate a variable length interleavingprocess of a symbol interleaver shown in FIG. 16;

FIG. 20A and FIG. 20B illustrate a block view showing a structure of ablock processor according to another embodiment of the presentinvention;

FIG. 21( a) to FIG. 21( c) illustrate examples of block-encoding andtrellis-encoding processes according to an embodiment of the presentinvention;

FIG. 22 illustrates a block view of a trellis encoding module accordingto an embodiment of present invention;

FIG. 23A and FIG. 23B illustrate a concatenation between a blockprocessor and a trellis encoding module according to the presentinvention;

FIG. 24 illustrates a block view showing a structure of a blockprocessor according to another embodiment of the present invention;

FIG. 25 illustrates a block view showing a structure of a blockprocessor according to yet another embodiment of the present invention;

FIG. 26 illustrates an example wherein a group formatter inserts andtransmits a transmission parameter according to the present invention;

FIG. 27 illustrates an example wherein a block processor inserts andtransmits a transmission parameter according to the present invention;

FIG. 28 illustrates an example wherein a packet formatter inserts andtransmits a transmission parameter according to the present invention;

FIG. 29 illustrates an example wherein a transmission parameteraccording to the present invention is inserted in a fieldsynchronization segment region;

FIG. 30 illustrates a block diagram of a digital broadcast receivingsystem according to the present invention;

FIG. 31 illustrates a data structure showing an example of known databeing periodically inserted in valid data according to the presentinvention;

FIG. 32 illustrates a flow chart showing a method of detecting positionsof known data according to an embodiment of the present invention;

FIG. 33 illustrates a block diagram showing a structure of a demodulatorof a digital broadcast receiving system shown in FIG. 30;

FIG. 34 illustrates a detailed block diagram of the demodulatoraccording to an embodiment of the present invention;

FIG. 35 illustrates a block diagram of a frequency offset estimatoraccording to an embodiment of the present invention;

FIG. 36 illustrates a block diagram of a known sequence detector (orknown data detector) and an initial frequency offset estimator accordingto the present invention;

FIG. 37 illustrates a block diagram of a partial correlator shown inFIG. 36;

FIG. 38 illustrates a second example of the timing recovery unitaccording to the present invention;

FIG. 39( a) and FIG. 39( b) illustrate examples of calculating acorrelation value between the known data and the received signal so asto detect timing error in a time domain;

FIG. 40( a) and FIG. 40( b) illustrate other examples of calculating acorrelation value between the known data and the received signal so asto detect timing error in a time domain;

FIG. 41 illustrates an example of correlation values when a timing errorexists;

FIG. 42 illustrates a detailed block view showing an example of a timingerror detector detecting timing error in a time domain according to anembodiment of the present invention;

FIG. 43 illustrates an example of a timing error detector detectingtiming frequency error according an embodiment of the present invention;

FIG. 44 illustrates an example of a timing error detector detectingtiming frequency error according another embodiment of the presentinvention;

FIG. 45 illustrates a block diagram of a DC remover according to anembodiment of the present invention;

FIG. 46 illustrates an example of input sample data inputted to the DCestimator shown in FIG. 45;

FIG. 47 illustrates a block diagram of a DC remover according to anotherembodiment of the present invention;

FIG. 48 is a flow chart illustrating a channel equalization methodaccording to an embodiment of the present invention;

FIG. 49 illustrates a block diagram of a channel equalizer according toan embodiment of the present invention;

FIG. 50 illustrates a block diagram of an example of a remaining carrierwave phase error estimator according to the present invention;

FIG. 51 illustrates a block diagram of a phase error detector of FIG.49;

FIG. 52 illustrates a phase compensator of FIG. 49;

FIG. 53 illustrates a block diagram of a channel equalizer according toanother embodiment of the present invention;

FIG. 54 illustrates a block diagram of a channel equalizer according toyet another embodiment of the present invention;

FIG. 55 illustrates a block diagram of a channel equalizer according toyet another embodiment of the present invention;

FIG. 56 illustrates a block diagram of an example of a CIR estimatoraccording to an embodiment of the present invention;

FIG. 57 illustrates a block diagram of an example of a block decoderaccording to an embodiment of the present invention;

FIG. 58 and FIG. 59 illustrate process steps of error correctiondecoding according to an embodiment of the present invention;

FIG. 60 illustrates another example of a digital broadcast receivingsystem according to the present invention.

FIG. 61 illustrates a block diagram showing an example of a transmissionparameter detector shown in FIG. 60 detecting a transmission parameter;

FIG. 62 illustrates a block diagram showing an example of a transmissionparameter detector shown in FIG. 60 detecting an SCCC mode;

FIG. 63 illustrates an example of extracting and outputting a groupvalid identifier according to the present invention;

FIG. 64 illustrates an example of extracting and outputting a burstvalid identifier according to the present invention;

FIG. 65 illustrates an example of comparing actual on/off times andburst sections according to the present invention;

FIG. 66 illustrates a block diagram of a receiving system according toan embodiment of the present invention;

FIG. 67 illustrates a bit stream syntax for a VCT according to thepresent invention;

FIG. 68 illustrates a service_type field according to an embodiment ofthe present invention;

FIG. 69 illustrates a service location descriptor according to anembodiment of the present invention;

FIG. 70 illustrates examples that may be assigned to the stream_typefield according to the present invention;

FIG. 71 illustrates a bit stream syntax for an EIT according to thepresent invention; and

FIG. 72 illustrates a block diagram of a receiving system according toanother embodiment of the present invention.

REFERENCE NUMERALS OF THE ESSENTIAL PARTS IN THE DRAWINGS

-   -   100: service multiplexer    -   110: controller    -   120,130: PSI/PSIP generator    -   140: null packet generator    -   150: mobile service multiplexer    -   160: transport multiplexer    -   161: main service multiplexer    -   162: transport stream(TS) packet multiplexer    -   210: demultiplexer 220: packet jitter mitigator    -   230: pre-processor 240: packet multiplexer    -   250: post-processor    -   260: synchronization multiplexer    -   270: transmission unit

DETAILED DESCRIPTION OF THE INVENTION Object of the Invention Field ofthe Invention and Discussion of the Related Art

The present invention relates to a digital broadcasting system andmethod of processing data for transmitting and receiving digitalbroadcast programs.

The Vestigial Sideband (VSB) transmission mode, which is adopted as thestandard for digital broadcasting in North America and the Republic ofKorea, is a system using a single carrier method. Therefore, thereceiving performance of the digital broadcast receiving system may bedeteriorated in a poor channel environment. Particularly, sinceresistance to changes in channels and noise is more highly required whenusing portable and/or mobile broadcast receivers, the receivingperformance may be even more deteriorated when transmitting mobileservice data by the VSB transmission mode.

TECHNICAL TASKS TO BE ACHIEVED BY THE INVENTION

Accordingly, the present invention is to provide a digital broadcastingsystem and a method of processing data in the digital broadcastingsystem that are highly resistant to channel changes and noise.

The present invention is to provide a digital broadcasting system and amethod of processing data in a digital broadcasting system that canenhance the receiving performance of a receiving system (or receiver) byhaving a transmitting system (or transmitter) perform additionalencoding on mobile service data.

The present invention is to provide a digital broadcasting system and amethod of processing data in the digital broadcasting system that canalso enhance the receiving performance of a digital broadcast receivingsystem by inserting known data already known in accordance with apre-agreement between the receiving system and the transmitting systemin a predetermined region within a data region.

CONFIGURATION OF THE INVENTION

To achieve these objects, a transmitting system according to anembodiment of the present invention includes a service multiplexer and atransmitter. The service multiplexer multiplexes mobile service data andmain service data at pre-determined data rates and, then, transmits themultiplexed service data to the transmitter. The transmitter performsadditional encoding on the mobile service data transmitted from theservice multiplexer and, also, groups a plurality of mobile service datapackets having encoding performed thereon so as to configure a datagroup.

Herein, the transmitter may multiplex a mobile service data packetincluding the mobile service data and a main service data packetincluding the main service data in packet units and may transmit themultiplexed data packets to a digital broadcast receiving system.Herein, the transmitter may multiplex the data group and the mainservice data packet in a burst structure, wherein the burst section maybe divided in a burst-on section including the data group, and aburst-off section that does not include the data group.

The data group may be divided into a plurality of regions based upon adegree of interference of the main service data. A long known datasequence may be periodically inserted in the region having nointerference with the main service data.

In another aspect of the present invention, a receiving system may usethe known data sequence for demodulating and channel equalizingprocesses.

When receiving only the mobile service data, the receiving system turnspower on only during the burst-on section so as to process the mobileservice data.

The objectives and other advantages of the invention may be realized andattained by the structure particularly pointed out in the writtendescription hereof as well as the appended drawings.

Reference will now be made in detail to the preferred embodiments of thepresent invention, examples of which are illustrated in the accompanyingdrawings.

Definition of the Terms Used in the Present Invention

In addition, although the terms used in the present invention areselected from generally known and used terms, some of the termsmentioned in the description of the present invention have been selectedby the applicant at his or her discretion, the detailed meanings ofwhich are described in relevant parts of the description herein.Furthermore, it is required that the present invention is understood,not simply by the actual terms used but by the meaning of each termlying within.

Among the terms used in the description of the present invention, mainservice data correspond to data that can be received by a fixedreceiving system and may include audio/video (A/V) data. Morespecifically, the main service data may include A/V data of highdefinition (HD) or standard definition (SD) levels and may also includediverse data types required for data broadcasting. Also, the known datacorrespond to data pre-known in accordance with a pre-arranged agreementbetween the receiving system and the transmitting system. Additionally,in the present invention, mobile service data may include at least oneof mobile service data, pedestrian service data, and handheld servicedata, and are collectively referred to as mobile service data forsimplicity. Herein, the mobile service data not only correspond tomobile/pedestrian/handheld service data (M/P/H service data) but mayalso include any type of service data with mobile or portablecharacteristics. Therefore, the mobile service data according to thepresent invention are not limited only to the M/P/H service data.

The above-described mobile service data may correspond to data havinginformation, such as program execution files, stock information, and soon, and may also correspond to A/V data. Most particularly, being a typeof service data for a portable or mobile terminal (or broadcastreceiver), the mobile service data may correspond to A/V data havinglower resolution and lower data rate as compared to the main servicedata. For example, if an A/V codec that is used for a conventional mainservice corresponds to a MPEG-2 codec, a MPEG-4 advanced video coding(AVC) or scalable video coding (SVC) having better image compressionefficiency may be used as the A/V codec for the mobile service.Furthermore, any type of data may be transmitted as the mobile servicedata. For example, transport protocol expert group (TPEG) data forbroadcasting real-time transportation information may be serviced as themain service data.

Also, a data service using the mobile service data may include weatherforecast services, traffic information services, stock informationservices, viewer participation quiz programs, real-time polls & surveys,interactive education broadcast programs, gaming services, servicesproviding information on synopsis, character, background music, andfilming sites of soap operas or series, services providing informationon past match scores and player profiles and achievements, and servicesproviding information on product information and programs classified byservice, medium, time, and theme enabling purchase orders to beprocessed. Herein, the present invention is not limited only to theservices mentioned above. In the present invention, the transmittingsystem provides backward compatibility in the main service data so as tobe received by the conventional receiving system. Herein, the mainservice data and the mobile service data are multiplexed to the samephysical channel and then transmitted.

The transmitting system according to the present invention performsadditional encoding on the mobile service data and inserts the dataalready known by the receiving system and transmitting system (i.e.,known data), thereby transmitting the processed data. Therefore, whenusing the transmitting system according to the present invention, thereceiving system may receive the mobile service data during a mobilestate and may also receive the mobile service data with stabilitydespite various distortion and noise occurring within the channel.

General Description of a Transmitting System

FIG. 1 illustrates a block diagram showing a general structure of adigital broadcast transmitting system according to an embodiment of thepresent invention. Herein, the digital broadcast transmitting includes aservice multiplexer 100 and a transmitter 200. Herein, the servicemultiplexer 100 is located in the studio of each broadcast station, andthe transmitter 200 is located in a site placed at a predetermineddistance from the studio. The transmitter 200 may be located in aplurality of different locations. Also, for example, the plurality oftransmitters may share the same frequency. And, in this case, theplurality of transmitters receives the same signal. Accordingly, in thereceiving system, a channel equalizer may compensate signal distortion,which is caused by a reflected wave, so as to recover the originalsignal. In another example, the plurality of transmitters may havedifferent frequencies with respect to the same channel.

A variety of methods may be used for data communication each of thetransmitters, which are located in remote positions, and the servicemultiplexer. For example, an interface standard such as a synchronousserial interface for transport of MPEG-2 data (SMPTE-310M). In theSMPTE-310M interface standard, a constant data rate is decided as anoutput data rate of the service multiplexer. For example, in case of the8 VSB mode, the output data rate is 19.39 Mbps, and, in case of the 16VSB mode, the output data rate is 38.78 Mbps. Furthermore, in theconventional 8 VSB mode transmitting system, a transport stream (TS)packet having a data rate of approximately 19.39 Mbps may be transmittedthrough a single physical channel. Also, in the transmitting systemaccording to the present invention provided with backward compatibilitywith the conventional transmitting system, additional encoding isperformed on the mobile service data. Thereafter, the additionallyencoded mobile service data are multiplexed with the main service datato a TS packet form, which is then transmitted. At this point, the datarate of the multiplexed TS packet is approximately 19.39 Mbps.

At this point, the service multiplexer 100 receives at least one type ofmobile service data and program specific information (PSI)/program andsystem information protocol (PSIP) table data for each mobile serviceand encapsulates the received data to each transport stream (TS) packet.Also, the service multiplexer 100 receives at least one type of mainservice data and PSI/PSIP table data for each main service so as toencapsulate the received data to a TS packet. Subsequently, the TSpackets are multiplexed according to a predetermined multiplexing ruleand outputs the multiplexed packets to the transmitter 200.

Service Multiplexer

FIG. 2 illustrates a block diagram showing an example of the servicemultiplexer. The service multiplexer includes a controller 110 forcontrolling the overall operations of the service multiplexer, aPSI/PSIP generator 120 for the main service, a PSI/PSIP generator 130for the mobile service, a null packet generator 140, a mobile servicemultiplexer 150, and a transport multiplexer 160. The transportmultiplexer 160 may include a main service multiplexer 161 and atransport stream (TS) packet multiplexer 162. Referring to FIG. 2, atleast one type of compression encoded main service data and the PSI/PSIPtable data generated from the PSI/PSIP generator 120 for the mainservice are inputted to the main service multiplexer 161 of thetransport multiplexer 160. The main service multiplexer 161 encapsulateseach of the inputted main service data and PSI/PSIP table data to MPEG-2TS packet forms. Then, the MPEG-2 TS packets are multiplexed andoutputted to the TS packet multiplexer 162. Herein, the data packetbeing outputted from the main service multiplexer 161 will be referredto as a main service data packet for simplicity.

Also, at least one type of the compression encoded mobile service dataand the PSI/PSIP table data generated from the PSI/PSIP generator 130for the mobile service are inputted to the mobile service multiplexer150. The mobile service multiplexer 150 encapsulates each of theinputted mobile service data and PSI/PSIP table data to MPEG-2 TS packetforms. Then, the MPEG-2 TS packets are multiplexed and outputted to theTS packet multiplexer 162. Herein, the data packet being outputted fromthe mobile service multiplexer 150 will be referred to as a mobileservice data packet for simplicity. At this point, the transmitter 200requires identification information in order to identify and process themain service data packet and the mobile service data packet. Herein, theidentification information may use values pre-decided in accordance withan agreement between the transmitting system and the receiving system,or may be configured of a separate set of data, or may modifypredetermined location values with in the corresponding data packet. Asan example of the present invention, a different packet identifier (PID)may be assigned to identify each of the main service data packet and themobile service data packet.

In another example, by modifying a synchronization data byte within aheader of the mobile service data packet, the service data packet may beidentified by using the synchronization data byte value of thecorresponding service data packet. For example, the synchronization byteof the main service data packet directly outputs the value decided bythe ISO/IEC13818-1 standard (i.e., 0x47) without any modification. Thesynchronization byte of the mobile service data packet modifies andoutputs the value, thereby identifying the main service data packet andthe mobile service data packet. Conversely, the synchronization byte ofthe main service data packet is modified and outputted, whereas thesynchronization byte of the mobile service data packet is directlyoutputted without being modified, thereby enabling each of the mainservice data packet and the mobile service data packet to be identified.

A plurality of methods may be applied in the method of modifying thesynchronization byte. For example, each bit of the synchronization bytemay be inversed, or only partial bits of the synchronization byte may beinversed. As described above, any type of identification information maybe used to identify the main service data packet and the mobile servicedata packet. Therefore, the scope of the present invention is notlimited only to the example set forth in the description of the presentinvention.

Meanwhile, a transport multiplexer used in the conventional digitalbroadcasting system may be used as the transport multiplexer 160according to the present invention. More specifically, in order tomultiplex the mobile service data and the main service data and totransmit the multiplexed data, the data rate of the main service islimited to a data rate of (19.39-K) Mbps. Then, K Mbps, whichcorresponds to the remaining data rate, is assigned as the data rate ofthe mobile service. Thus, the transport multiplexer which is alreadybeing used may be used as it is without any modification. Herein, thetransport multiplexer 160 multiplexes the main service data packet beingoutputted from the main service multiplexer 161 and the mobile servicedata packet being outputted from the mobile service multiplexer 150.Thereafter, the transport multiplexer 160 transmits the multiplexed datapackets to the transmitter 200.

However, in some cases, the output data rate of the mobile servicemultiplexer 150 may not be equal to K Mbps. In this case, the mobileservice multiplexer 150 multiplexes and outputs null data packetsgenerated from the null packet generator 140 so that the output datarate can reach K Mbps. More specifically, in order to match the outputdata rate of the mobile service multiplexer 150 to a constant data rate,the null packet generator 140 generates null data packets, which arethen outputted to the mobile service multiplexer 150. For example, whenthe service multiplexer 100 assigns K Mbps of the 19.39 Mbps to themobile service data, and when the remaining (19.39-K) Mbps is,therefore, assigned to the main service data, the data rate of themobile service data that are multiplexed by the service multiplexer 100actually becomes lower than K Mbps. This is because, in case of themobile service data, the pre-processor of the transmitting systemperforms additional encoding, thereby increasing the amount of data.Eventually, the data rate of the mobile service data, which may betransmitted from the service multiplexer 100, becomes smaller than KMbps.

For example, since the pre-processor of the transmitter performs anencoding process on the mobile service data at a coding rate of at least½, the amount of the data outputted from the pre-processor is increasedto more than twice the amount of the data initially inputted to thepre-processor. Therefore, the sum of the data rate of the main servicedata and the data rate of the mobile service data, both beingmultiplexed by the service multiplexer 100, becomes either equal to orsmaller than 19.39 Mbps. Therefore, in order to match the data rate ofthe data that are finally outputted from the service multiplexer 100 toa constant data rate (e.g., 19.39 Mbps), an amount of null data packetscorresponding to the amount of lacking data rate is generated from thenull packet generator 140 and outputted to the mobile servicemultiplexer 150.

Accordingly, the mobile service multiplexer 150 encapsulates each of themobile service data and the PSI/PSIP table data that are being inputtedto a MPEG-2 TS packet form. Then, the above-described TS packets aremultiplexed with the null data packets and, then, outputted to the TSpacket multiplexer 162. Thereafter, the TS packet multiplexer 162multiplexes the main service data packet being outputted from the mainservice multiplexer 161 and the mobile service data packet beingoutputted from the mobile service multiplexer 150 and transmits themultiplexed data packets to the transmitter 200 at a data rate of 19.39Mbps.

According to an embodiment of the present invention, the mobile servicemultiplexer 150 receives the null data packets. However, this is merelyexemplary and does not limit the scope of the present invention. Inother words, according to another embodiment of the present invention,the TS packet multiplexer 162 may receive the null data packets, so asto match the data rate of the finally outputted data to a constant datarate. Herein, the output path and multiplexing rule of the null datapacket is controlled by the controller 110. The controller 110 controlsthe multiplexing processes performed by the mobile service multiplexer150, the main service multiplexer 161 of the transport multiplexer 160,and the TS packet multiplexer 162, and also controls the null datapacket generation of the null packet generator 140. At this point, thetransmitter 200 discards (or deletes) the null data packets transmittedfrom the service multiplexer 100 instead of transmitting the null datapackets.

Further, in order to allow the transmitter 200 to discard the null datapackets transmitted from the service multiplexer 100 instead oftransmitting them, identification information for identifying the nulldata packet is required. Herein, the identification information may usevalues pre-decided in accordance with an agreement between thetransmitting system and the receiving system. For example, the value ofthe synchronization byte within the header of the null data packet maybe modified so as to be used as the identification information.Alternatively, a transport_error_indicator flag may also be used as theidentification information.

In the description of the present invention, an example of using thetransport_error_indicator flag as the identification information will begiven to describe an embodiment of the present invention. In this case,the transport_error_indicator flag of the null data packet is set to‘1’, and the transport_error_indicator flag of the remaining datapackets are reset to ‘0’, so as to identify the null data packet. Morespecifically, when the null packet generator 140 generates the null datapackets, if the transport_error_indicator flag from the header field ofthe null data packet is set to ‘1’ and then transmitted, the null datapacket may be identified and, therefore, be discarded. In the presentinvention, any type of identification information for identifying thenull data packets may be used. Therefore, the scope of the presentinvention is not limited only to the examples set forth in thedescription of the present invention.

According to another embodiment of the present invention, a transmissionparameter may be included in at least a portion of the null data packet,or in at least one table or an operations and maintenance (OM) packet(or OMP) of the PSI/PSIP table for the mobile service. In this case, thetransmitter 200 extracts the transmission parameter and outputs theextracted transmission parameter to the corresponding block and alsotransmits the extracted parameter to the receiving system if required.More specifically, a packet referred to as an OMP is defined for thepurpose of operating and managing the transmitting system. For example,the OMP is configured in accordance with the MPEG-2 TS packet format,and the corresponding PID is given the value of 0x1FFA. The OMP isconfigured of a 4-byte header and a 184-byte payload. Herein, among the184 bytes, the first byte corresponds to an OM_type field, whichindicates the type of the OM packet.

In the present invention, the transmission parameter may be transmittedin the form of an OMP. And, in this case, among the values of thereserved fields within the OM_type field, a pre-arranged value is used,thereby indicating that the transmission parameter is being transmittedto the transmitter 200 in the form of an OMP. More specifically, thetransmitter 200 may find (or identify) the OMP by referring to the PID.Also, by parsing the OM_type field within the OMP, the transmitter 200can verify whether or not a transmission parameter is included after theOM_type field of the corresponding packet.

The transmission parameter corresponds to supplemental data required forprocessing mobile service data from the transmitting system and thereceiving system. For example, the transmission parameter may includedata group information, region information within the data group, RSframe information, super frame information, burst information, turbocode information, and RS code information. The burst information mayinclude burst size information, burst period information, and timeinformation to next burst. The burst period signifies the period atwhich the burst transmitting the same mobile service is repeated. Thedata group includes a plurality of mobile service data packets, and aplurality of such data groups is gathered (or grouped) to form a burst.A burst section signifies the beginning of a current burst to thebeginning of a next burst. Herein, the burst section is classified as asection that includes the data group (also referred to as a burst-onsection), and a section that does not include the data group (alsoreferred to as a burst-off section). A burst-on section is configured ofa plurality of fields, wherein one field includes one data group.

The transmission parameter may also include information on how signalsof a symbol domain are encoded in order to transmit the mobile servicedata, and multiplexing information on how the main service data and themobile service data or various types of mobile service data aremultiplexed. The information included in the transmission parameter ismerely exemplary to facilitate the understanding of the presentinvention. And, the adding and deleting of the information included inthe transmission parameter may be easily modified and changed by anyoneskilled in the art. Therefore, the present invention is not limited tothe examples proposed in the description set forth herein.

Furthermore, the transmission parameters may be provided from theservice multiplexer 100 to the transmitter 200. Alternatively, thetransmission parameters may also be set up by an internal controller(not shown) within the transmitter 200 or received from an externalsource.

Transmitter

FIG. 3 illustrates a block diagram showing an example of the transmitter200 according to an embodiment of the present invention. Herein, thetransmitter 200 includes a demultiplexer 210, a packet jitter mitigator220, a pre-processor 230, a packet multiplexer 240, a post-processor250, a synchronization (sync) multiplexer 260, and a transmission unit270. Herein, when a data packet is received from the service multiplexer100, the demultiplexer 210 should identify whether the received datapacket corresponds to a main service data packet, a mobile service datapacket, or a null data packet. For example, the demultiplexer 210 usesthe PID within the received data packet so as to identify the mainservice data packet and the mobile service data packet. Then, thedemultiplexer 210 uses a transport_error_indicator field to identify thenull data packet. The main service data packet identified by thedemultiplexer 210 is outputted to the packet jitter mitigator 220, themobile service data packet is outputted to the pre-processor 230, andthe null data packet is discarded. If a transmission parameter isincluded in the null data packet, then the transmission parameter isfirst extracted and outputted to the corresponding block. Thereafter,the null data packet is discarded.

The pre-processor 230 performs an additional encoding process on themobile service data included in the service data packet, which isdemultiplexed and outputted from the demultiplexer 210. Thepre-processor 230 also performs a process of configuring a data group sothat the data group may be positioned at a specific place in accordancewith the purpose of the data, which are to be transmitted on atransmission frame. This is to enable the mobile service data to respondswiftly and strongly against noise and channel changes. Thepre-processor 230 may also refer to the transmission parameter whenperforming the additional encoding process. Also, the pre-processor 230groups a plurality of mobile service data packets to configure a datagroup. Thereafter, known data, mobile service data, RS parity data, andMPEG header are allocated (or assigned) to pre-determined areas withinthe data group.

Pre-Processor within Transmitter

FIG. 4 illustrates a block diagram showing an example of thepre-processor 230 according to the present invention. The pre-processor230 includes a data randomizer 301, a RS frame encoder 302, a blockprocessor 303, a group formatter 304, a data deinterleaver 305, and apacket formatter 306. The data randomizer 301 within the above-describedpre-processor 230 randomizes the mobile service data packet includingthe mobile service data that is inputted through the demultiplexer 210.Then, the data randomizer 301 outputs the randomized mobile service datapacket to the RS frame encoder 302. At this point, since the datarandomizer 301 performs the randomizing process on the mobile servicedata, the randomizing process that is to be performed by the datarandomizer 251 of the post-processor 250 on the mobile service data maybe omitted. The data randomizer 301 may also discard the synchronizationbyte within the mobile service data packet and perform the randomizingprocess. This is an option that may be chosen by the system designer. Inthe example given in the present invention, the randomizing process isperformed without discarding the synchronization byte within the mobileservice data packet.

The RS frame encoder 302 groups a plurality of synchronization byteswithin the mobile service data packets that is randomized and inputted,so as to create a RS frame. Then, the RS frame encoder 302 performs atleast one of an error correction encoding process and an error detectionencoding process in RS frame units. Accordingly, robustness may beprovided to the mobile service data, thereby scattering group error thatmay occur during changes in a frequency environment, thereby enablingthe mobile service data to respond to the frequency environment, whichis extremely vulnerable and liable to frequent changes. Also, the RSframe encoder 302 groups a plurality of RS frame so as to create a superframe, thereby performing a row permutation process in super frameunits. The row permutation process may also be referred to as a rowinterleaving process. Hereinafter, the process will be referred to asrow permutation for simplicity.

More specifically, when the RS frame encoder 302 performs the process ofpermuting each row of the super frame in accordance with apre-determined rule, the position of the rows within the super framebefore and after the row permutation process is changed. If the rowpermutation process is performed by super frame units, and even thoughthe section having a plurality of errors occurring therein becomes verylong, and even though the number of errors included in the RS frame,which is to be decoded, exceeds the extent of being able to becorrected, the errors become dispersed within the entire super frame.Thus, the decoding ability is even more enhanced as compared to a singleRS frame.

At this point, as an example of the present invention, RS-encoding isapplied for the error correction encoding process, and a cyclicredundancy check (CRC) encoding is applied for the error detectionencoding process. When performing the RS-encoding process, parity datathat are used for the error correction are generated. And, whenperforming the CRC encoding process, CRC data that are used for theerror detection are generated. RS-encoding is one of forward errorcorrection (FEC) methods. The FEC corresponds to a technique forcompensating errors that occur during the transmission process. The CRCdata generated by CRC encoding may be used for indicating whether or notthe mobile service data have been damaged by the errors while beingtransmitted through the channel. In the present invention, a variety oferror detection encoding methods other than the CRC encoding method maybe used, or the error correction encoding method may be used to enhancethe overall error correction ability of the receiving system. Herein,the RS frame encoder 302 refers to a pre-determined transmissionparameter and/or the transmission parameter provided from the servicemultiplexer 100 so as to perform operations including RS frameconfiguration, RS encoding, CRC encoding, super frame configuration, androw permutation in super frame units.

RS Frame Encoder within Pre-Processor

FIG. 5( a) to FIG. 5( e) illustrate error correction encoding and errordetection encoding processes according to an embodiment of the presentinvention. More specifically, the RS frame encoder 302 first divides theinputted mobile service data bytes to units of a predetermined length.The predetermined length is decided by the system designer. And, in theexample of the present invention, the predetermined length is equal to187 bytes, and, therefore, the 187-byte unit will be referred to as apacket for simplicity. For example, when the mobile service data thatare being inputted, as shown in FIG. 5( a), correspond to a MPEGtransport stream (TS) packet configured of 188-byte units, the firstsynchronization byte is removed, as shown in FIG. 5( b), so as toconfigure a 187-byte unit. Herein, the synchronization byte is removedbecause each mobile service data packet has the same value.

Herein, the process of removing the synchronization byte may beperformed during a randomizing process of the data randomizer 301 in anearlier process. In this case, the process of the removing thesynchronization byte by the RS frame encoder 302 may be omitted.Moreover, when adding synchronization bytes from the receiving system,the process may be performed by the data derandomizer instead of the RSframe decoder. Therefore, if a removable fixed byte (e.g.,synchronization byte) does not exist within the mobile service datapacket that is being inputted to the RS frame encoder 302, or if themobile service data that are being inputted are not configured in apacket format, the mobile service data that are being inputted aredivided into 187-byte units, thereby configuring a packet for each187-byte unit.

Subsequently, as shown in FIG. 5( c), N number of packets configured of187 bytes is grouped to configure a RS frame. At this point, the RSframe is configured as a RS frame having the size of N(row)*187(column)bytes, in which 187-byte packets are sequentially inputted in a rowdirection. In order to simplify the description of the presentinvention, the RS frame configured as described above will also bereferred to as a first RS frame. More specifically, only pure mobileservice data are included in the first RS frame, which is the same asthe structure configured of 187 N-byte rows. Thereafter, the mobileservice data within the RS frame are divided into equal sizes. Then,when the divided mobile service data are transmitted in the same orderas the input order for configuring the RS frame, and when one or moreerrors have occurred at a particular point during thetransmitting/receiving process, the errors are clustered (or gathered)within the RS frame as well. In this case, the receiving system uses aRS erasure decoding method when performing error correction decoding,thereby enhancing the error correction ability. At this point, the Nnumber of columns within the N number of RS frame includes 187 bytes, asshown in FIG. 5( c).

In this case, a (Nc,Kc)−RS encoding process is performed on each column,so as to generate Nc−Kc(=P) number of parity bytes. Then, the newlygenerated P number of parity bytes is added after the very last byte ofthe corresponding column, thereby creating a column of (187+P) bytes.Herein, as shown in FIG. 5( c), Kc is equal to 187 (i.e., Kc=187), andNc is equal to 187+P (i.e., Nc=187+P). For example, when P is equal to48, (235,187)-RS encoding process is performed so as to create a columnof 235 bytes. When such RS encoding process is performed on all N numberof columns, as shown in FIG. 5( c), a RS frame having the size ofN(row)*(187+P) (column) bytes may be created, as shown in FIG. 5( d). Inorder to simplify the description of the present invention, the RS framehaving the RS parity inserted therein will be referred to as second RSframe. More specifically, the second RS frame having the structure of(187+P) rows configured of N bytes may be configured.

As shown in FIG. 5( c) or FIG. 5( d), each row of the RS frame isconfigured of N bytes. However, depending upon channel conditionsbetween the transmitting system and the receiving system, error may beincluded in the RS frame. When errors occur as described above, CRC data(or CRC code or CRC checksum) may be used on each row unit in order toverify whether error exists in each row unit. The RS frame encoder 302may perform CRC encoding on the mobile service data being RS encoded soas to create (or generate) the CRC data. The CRC data being generated byCRC encoding may be used to indicate whether the mobile service datahave been damaged while being transmitted through the channel.

The present invention may also use different error detection encodingmethods other than the CRC encoding method. Alternatively, the presentinvention may use the error correction encoding method to enhance theoverall error correction ability of the receiving system. FIG. 5( e)illustrates an example of using a 2-byte (i.e., 16-bit) CRC checksum asthe CRC data. Herein, a 2-byte CRC checksum is generated for N number ofbytes of each row, thereby adding the 2-byte CRC checksum at the end ofthe N number of bytes. Thus, each row is expanded to (N+2) number ofbytes. Equation 1 below corresponds to an exemplary equation forgenerating a 2-byte CRC checksum for each row being configured of Nnumber of bytes.

g(x)=x ¹⁶ +x ¹² +x ⁵+1  Equation 1

The process of adding a 2-byte checksum in each row is only exemplary.Therefore, the present invention is not limited only to the exampleproposed in the description set forth herein. In order to simplify theunderstanding of the present invention, the RS frame having the RSparity and CRC checksum added therein will hereinafter be referred to asa third RS frame. More specifically, the third RS frame corresponds to(187+P) number of rows each configured of (N+2) number of bytes. Asdescribed above, when the RS-encoding and CRC-encoding processes arecompleted, the (N*187)-byte RS frame is expanded to a (N+2)*(187+P)-byteRS frame.

Based upon an error correction scenario of a RS frame, the data byteswithin the RS frame are transmitted through a channel in a rowdirection. At this point, when a large number of errors occur during alimited period of transmission time, errors also occur in a rowdirection within the RS frame being processed with a decoding process inthe receiving system. However, in the perspective of RS encodingperformed in a column direction, the errors are shown as beingscattered. Therefore, error correction may be performed moreeffectively. At this point, a method of increasing the number of paritydata bytes (P) may be used in order to perform a more intense errorcorrection process. However, using this method may lead to a decrease intransmission efficiency. Therefore, a mutually advantageous method isrequired. Furthermore, when performing the decoding process, an erasuredecoding process may be used to enhance the error correctionperformance.

The RS frame encoder according to the present invention also performs arow permutation (or interleaving) process in super frame units in orderto further enhance the error correction performance when errorcorrection the RS frame. FIG. 6 illustrates an example of performing arow permutation (or interleaving) process in super frame units accordingto the present invention. More specifically, G number of RS framesencoded as shown in FIG. 5 is grouped to form a super frame, as shown inFIG. 6( a). At this point, since each RS frame is formed of(N+2)*(187+P) number of bytes, one super frame is configured to have thesize of (N+2)*(187+P)*G bytes.

When a row permutation process permuting each row of the super frameconfigured as described above is performed based upon a pre-determinedpermutation rule, the positions of the rows prior to and after beingpermuted (or interleaved) within the super frame may be altered. Morespecifically, the i^(th) row of the super frame prior to theinterleaving process, as shown in FIG. 6( b), is positioned in thej^(th) row of the same super frame after the row permutation process.The above-described relation between i and j can be easily understoodwith reference to a permutation rule as shown in Equation 2 below.

j=G(i mod(187+P))+└i/(187+P)┘

i=(187+P)(j mod G)+└j/G┘

where 0≦i, j≦(187+P)G−1; or

where 0≦i, j<(187+P)G  Equation 2

Herein, each row of the super frame is configured of (N+2) number ofdata bytes even after being row-permuted in super frame units.

When all row permutation processes in super frame units are completed,the super frame is once again divided into G number of row-permuted RSframes, as shown in FIG. 6( d), and then provided to the block processor303. Herein, the number of RS parity bytes and the number of columnsshould be equally provided in each of the RS frames, which configure asuper frame. As described in the error correction scenario of a RSframe, in case of the super frame, a section having a large number oferrors occurring therein is so long that, even when one RS frame that isto be decoded includes an excessive number of errors (i.e., to an extentthat the errors cannot be corrected), such errors can be scatteredthroughout the entire super frame. Therefore, in comparison with asingle RS frame, the decoding performance of the super frame is moreenhanced.

As described above, the mobile service data being encoded in RS frameunits and row-permuted in super frame units by the RS frame encoders 302are outputted to the block processor 303. The block processor 303 thenencodes the inputted mobile service data at a coding rate of D/E(wherein, D is smaller than E (i.e., D<E)) and then outputted to thegroup formatter 304. More specifically, the block processor 303 dividesthe mobile service data being inputted in byte units into bit units.Then, the D number of bits is encoded to E number of bits. Thereafter,the encoded bits are converted back to byte units and then outputted.For example, if 1 bit of the input data is encoded to 2 bits andoutputted, then D is equal to 1 and E is equal to 2 (i.e., D=1 and E=2).Alternatively, if 1 bit of the input data is encoded to 4 bits andoutputted, then D is equal to 1 and E is equal to 4 (i.e., D=1 and E=4).Hereinafter, the former coding rate will be referred to as a codingprocess at a rate of ½ (or a ½-rate coding process), and the lattercoding rate will be referred to as a coding process at a rate of ¼ (or a¼-rate coding process), for simplicity.

Herein, when using the ¼ coding rate, the coding efficiency is greaterthan when using the ½ coding rate, and may, therefore, provide greaterand enhanced error correction ability. For such reason, when it isassumed that the data encoded at a ¼ coding rate in the group formatter304, which is located at a later portion of the system, are assigned toa region which the receiving performance may be deteriorated, and thatthe data encoded at a ½ coding rate are assigned to a region havingexcellent receiving performance, the difference in performance may bereduced. At this point, the block processor 303 may also receivesignaling information including transmission parameters. Herein, thesignaling information may also be processed with either ½-rate coding or¼-rate coding as described in the step of processing mobile servicedata. Thereafter, the signaling information is also considered to be thesame as the mobile service data and processed accordingly.

Meanwhile, the group formatter 304 inserts mobile service data that areoutputted from the block processor 303 in corresponding regions within adata group, which is configured in accordance with a pre-defined rule.Also, with respect to the data deinterleaving process, each place holderor known data (or known data place holders) are also inserted incorresponding regions within the data group. At this point, the datagroup may be divided into at least one hierarchical region. Herein, thetype of mobile service data being inserted in each region may varydepending upon the characteristics of each hierarchical region.Additionally, each region may, for example, be divided based upon thereceiving performance within the data group. Furthermore, one data groupmay be configured to include a set of field synchronization data.

In an example given in the present invention, a data group is dividedinto A, B, and C regions in a data configuration prior to datadeinterleaving. At this point, the group formatter 304 assigns themobile service data, which are inputted after being RS encoded and blockencoded, to each of the corresponding regions by referring to thetransmission parameter. FIG. 7A illustrates an alignment of data afterbeing data interleaved and identified, and FIG. 7B illustrates analignment of data before being data interleaved and identified. Morespecifically, a data structure identical to that shown in FIG. 7A istransmitted to a receiving system. Also, the data group configured tohave the same structure as the data structure shown in FIG. 7A isinputted to the data deinterleaver 305.

As described above, FIG. 7A illustrates a data structure prior to datadeinterleaving that is divided into 3 regions, such as region A, regionB, and region C. Also, in the present invention, each of the regions Ato C is further divided into a plurality of hierarchically lowerregions. Referring to FIG. 7A, region A is divided into 5 sub-regions(A1 to A5), region B is divided into 2 sub-regions (B1 and B2), andregion C is divided into 3 sub-regions (C1 to C3). Herein, regions A toC are identified as regions having similar receiving performances withinthe data group. Herein, the type of mobile service data, which areinputted, may also vary depending upon the characteristic of eachregion.

In the example of the present invention, the data structure is dividedinto regions A to C based upon the level of interference of the mainservice data. Herein, the data group is divided into a plurality ofregions to be used for different purposes. More specifically, a regionof the main service data having no interference or a very lowinterference level may be considered to have a more resistant (orstronger) receiving performance as compared to regions having higherinterference levels. Additionally, when using a system inserting andtransmitting known data in the data group, and when consecutively longknown data are to be periodically inserted in the mobile service data,the known data having a predetermined length may be periodicallyinserted in the region having no interference from the main service data(e.g., region A). However, due to interference from the main servicedata, it is difficult to periodically insert known data and also toinsert consecutively long known data to a region having interferencefrom the main service data (e.g., region B and region C).

At this point, the data group includes a position in which a fieldsynchronization signal is to be inserted. The group formatter 304operates regardless of the insertion position of the fieldsynchronization signal. And, the actual field synchronization signal isinserted in a field synchronization signal insertion positionpre-defined by a synchronization multiplexer 260 in a later block. As adata structure prior to the data interleaving process, FIG. 7Billustrates an example of 118 segments being assigned to one data group.More specifically, the data group of FIG. 7B includes 38 segments beforethe field synchronization signal insertion position and 80 segmentsafter the field synchronization signal insertion position.

Hereinafter, examples of allocating data to region A (A1 to A5), regionB (B1 and B2), and region C (C1 to C3) will now be described in detailwith reference to FIG. 7A. The data group size, the number ofhierarchically divided regions within the data group and the size ofeach region, and the number of mobile service data bytes that can beinserted in each hierarchically divided region of FIG. 7A are merelyexamples given to facilitate the understanding of the present invention.Herein, the group formatter 304 creates a data group including places inwhich field synchronization data bytes are to be inserted, so as tocreate the data group that will hereinafter be described in detail.

More specifically, region A is a region within the data group in which along known data sequence may be periodically inserted, and in whichincludes regions wherein the main service data are not mixed (e.g., A2to A5). Also, region A includes a region (e.g., A1) located between afield synchronization region and the region in which the first knowndata sequence is to be inserted. For example, referring to FIG. 7A, 2428bytes of the mobile service data may be inserted in sub-region A1, 2580bytes may be inserted in sub-region A2, 2772 bytes may be inserted insub-region A3, 2472 bytes may be inserted in sub-region A4, and 2772bytes may be inserted in sub-region A5. Herein, trellis initializationdata or known data, MPEG header, and RS parity are not included in themobile service data. As described above, when region A includes a knowndata sequence at both ends, the receiving system uses channelinformation that can obtain known data or field synchronization data, soas to perform equalization, thereby providing enforced equalizationperformance.

Also, region B includes a region located within 8 segments at thebeginning of a field synchronization region within the data group(chronologically placed before sub-region A1) (e.g., sub-region B1), anda region located within 8 segments behind the very last known datasequence which is inserted in the data group (chronologically placedafter region A) (e.g., sub-region B2). For example, 930 bytes of themobile service data may be inserted in the sub-region B1, and 1350 bytesmay be inserted in sub-region B2. Similarly, trellis initialization dataor known data, MPEG header, and RS parity are not included in the mobileservice data. In case of region B, the receiving system may performequalization by using channel information obtained from the fieldsynchronization region. Alternatively, the receiving system may alsoperform equalization by using channel information that may be obtainedfrom the last known data sequence, thereby enabling the system torespond to the channel changes.

Region C includes a region located within 30 segments including andpreceding the 9^(th) segment of the field synchronization region(chronologically located before region A) (e.g., sub-region C1), aregion located within 12 segments including and following the 9^(th)segment of the very last known data sequence within the data group(chronologically located after region A) (e.g., sub-region C2), and aregion located in 32 segments after the sub-region C2 (e.g., sub-regionC3). For example, 1272 bytes of the mobile service data may be insertedin the sub-region C1, 1560 bytes may be inserted in sub-region C2, and1312 bytes may be inserted in sub-region C3. Similarly, trellisinitialization data or known data, MPEG header, and RS parity are notincluded in the mobile service data.

Herein, sub-region C1 is located chronologically earlier than (orbefore) region A. And, since sub-region C1 is located further apart fromthe field synchronization region which corresponds to the closest knowndata region, the receiving system may use the channel informationobtained from the field synchronization data when performing channelequalization. Alternatively, the receiving system may also use the mostrecent channel information of a previous data group. Furthermore, insub-region C2 and sub-region C3 located chronologically after region A,the receiving system may use the channel information obtained from thelast known data sequence to perform equalization. However, when thechannels are subject to fast and frequent changes, the equalization maynot be performed perfectly. Therefore, the equalization performance ofregion C may be deteriorated as compared to that of region B.

When it is assumed that the data group is allocated with a plurality ofhierarchically divided regions, as described above, the block processor303 may encode the mobile service data, which are to be inserted to eachregion based upon the characteristic of each hierarchical region, at adifferent coding rate. For example, the block processor 303 may encodethe mobile service data, which are to be inserted in sub-regions A1 toA5 of region A, at a coding rate of ½. Then, the group formatter 304 mayinsert the ½-rate encoded mobile service data to sub-regions A1 to A5.

The block processor 303 may encode the mobile service data, which are tobe inserted in regions B1 and B2 of region B, at a coding rate of ¼having higher error correction ability as compared to the ½-coding rate.Then, the group formatter 304 inserts the ¼-rate coded mobile servicedata in sub-region B1 and sub-region B2. Furthermore, the blockprocessor 303 may encode the mobile service data, which are to beinserted in sub-regions C1 to C3 of region C, at a coding rate of ¼ or acoding rate having higher error correction ability than the ¼-codingrate. Then, the group formatter 304 may either insert the encoded mobileservice data to sub-regions C1 to C3, as described above, or leave thedata in a reserved region for future usage.

In addition, the group formatter 304 also inserts supplemental data,such as signaling information that notifies the overall transmissioninformation, other than the mobile service data in the data group. Also,apart from the encoded mobile service data outputted from the blockprocessor 303, the group formatter 304 also inserts MPEG header placeholders, non-systematic RS parity place holders, main service data placeholders, which are related to data deinterleaving in a later process, asshown in FIG. 7A. Herein, the main service data place holders areinserted because the mobile service data bytes and the main service databytes are alternately mixed with one another in regions B and C basedupon the input of the data deinterleaver, as shown in FIG. 7A. Forexample, based upon the data outputted after data deinterleaving, theplace holder for the MPEG header may be allocated at the very beginningof each packet.

Furthermore, the group formatter 304 either inserts known data generatedin accordance with a pre-determined method or inserts known data placeholders for inserting the known data in a later process. Additionally,place holders for initializing the trellis encoding module 256 are alsoinserted in the corresponding regions (i.e., red region). According toan embodiment of the present invention, the initialization data placeholders may be inserted in the beginning of the known data sequence. Forexample, in the data structure shown in FIG. 7A, five known data regions(i.e., blue region) are assigned to region A within the data group, inorder to insert the known data or known data place holders. Hereinafter,each of the five known data regions will be respectively referred to asa first known data region, a second known data region, a third knowndata region, a fourth known data region, and a fifth known data region,for simplicity.

Herein, at least one of the first to fifth known data regions (e.g., thefirst known data region) includes an identical pattern that is repeatedat least two times within the known data. The repeating known datapattern will hereinafter be referred to as a first known data patternfor simplicity. The first known data pattern may be used by thereceiving system for the acquisition of an initial carrier wavefrequency synchronization signal, or the first known data pattern may beused for estimating a field synchronization signal position or aposition of another known data region. Known data sequences having thesame pattern are included in each of the first to fifth known dataregion. And, in order to be differentiated from the first known datapatterns, the pattern will be referred to as a second known datapattern. According to an embodiment of the present invention, the firstknown data pattern and the second known data pattern have differentlengths.

The length of the known data sequence of the second known data patternmay be either be equal to or different from the length of the entireknown data sequence of the corresponding known data region.Alternatively, the length of the entire known data sequence is longerthan the known data sequence of the second known data pattern, and thesecond known data pattern is included in the entire known data sequence.In the example of the present invention, 1424 symbols (i.e., 356 bytes)are inserted in each of the first to fifth known data regions as thesecond known data pattern. The second known data pattern that isinserted in the first to fifth known data region may be used by thereceiving system as a training sequence or may be used for estimating achannel impulse response (CIR).

Furthermore, apart from the mobile service data, the group formatter 304may also insert additional information, such as signaling informationthat notifies overall transmission information, in the data group. Atransmission parameter associated with the transmission and reception ofbroadcast signals may be determined as the signaling information.Herein, the size of the mobile service data that can be inserted in adata group may vary in accordance with the sizes of the trellisinitialization place holders or known data (or known data placeholders), MPEG header place holders, and RS parity place holders.

FIG. 8 illustrates a part of data region A of the signal frame shown inFIG. 7A. Most particularly, FIG. 8 illustrates an expanded view from thefield synchronization segment to the third known data region. The dataframe of FIG. 8 indicates in symbol units the data bytes that areinserted in each region and outputted. Herein, 1 byte is configured of 4symbols, and 1 symbol in configured of 2 bits. In the data frame shownin FIG. 8, the field synchronization segment is configured of 832symbols. Herein, known data sequences may be included in part of the 832symbols.

Each known data region includes an initialization data region (i.e., redregion) that transmits the trellis memory initialization data. Forexample, 48 symbols may be assigned to the initialization data region.At this point, the initialization data required for initializing one ofthe 12 trellis encoders correspond to 2 symbols. Accordingly, 24 symbolswill be required for initializing all 12 trellis encoders. Therefore,the remaining 24 symbols within the initialization data region of eachknown data region may be used as known data. Also, at least one of thefirst to fifth known data region (e.g., first known data region)includes the first known data pattern, and each of the first to fifthknown data region includes the second known data pattern. The secondknown data pattern may either be included immediately after the trellismemory initialization data within the corresponding known data region orbe included after the known data sequence of a different pattern. Thisis to enable the second known data patterns to maintain equal intervals,even though the starting point of the first to fifth known data regionsand the lengths of the first to fifth known data regions are differentfrom one another.

The first known data region positioned after approximately 16 segmentsfrom the field synchronization segment includes a trellis memoryinitialization data region (i.e., red region), a third known datapattern region (i.e., diagonally striped blue region), a second knowndata pattern region (i.e., CIR TS region), a fourth known data patternregion (i.e., reserved TS region), and a first known data pattern region(i.e., ACQ TS region). For example, the trellis memory initializationdata region (i.e., red region) corresponds to a region having 24 symbolsassigned thereto and having a trellis memory initialization processperformed thereon by the transmitting system. The third known datapattern region (i.e., diagonally striped blue region) corresponds to aregion assigned in reserve so as to enable the second known data patternto maintain the same interval as the second known data pattern ofanother known data region. A third known data pattern included in thethird known data pattern region may either be used by the receivingsystem or be left in reserve for future usage.

Also, in the second known data pattern region (i.e., CIR TS region),1424 symbols are assigned, and a second known data pattern that can beused for channel equalization is inserted. The starting point within thesegment of the second known data pattern region is the same for allknown data regions. Furthermore, 252 symbols are assigned to the fourthknown data pattern region (i.e., reserved TS region). According to theembodiment of the present invention, a transmission parameter isinserted in the fourth known data pattern region and then transmitted.For example, a mode information indicating the data rate of each regionwithin the data group may be inserted. Herein, the mode indicating thedata rate of each region within the data group will be referred to asserial concatenated convolution code (SCCC) for simplicity. For example,when a SCCC mode information having six different patterns istransmitted as a transmission (i.e., as signaling information) andinserted in the fourth known data pattern region, prior to performingthe decoding process according to the SCCC mode, the receiving systemmay acquire information on the SCCC mode from the fourth known datapattern region, so as to decode the received signal. Examples of theSCCC mode are shown in Table 1 below.

TABLE 1 Coding Rate of SCCC SCCC Mode Region A Region B Region C 0 1/21/2 1/2 1 1/2 1/2 1/4 2 1/2 1/4 1/2 3 1/2 1/4 1/4 4 1/4 1/4 1/2 5 1/41/4 1/4

For example, when the SCCC mode value that is extracted from the fourthknown data pattern region is equal to ‘2’, this indicates that region Aand region C within the corresponding data group are encoded at a codingrate of ½ and that region B is encoded at a coding rate of ¼. Thetransmitting system of the present invention generates 6 patternscorresponding to each mode value shown in Table 1 based upon anagreement between the transmitting system and the receiving system.Herein, the corresponding pattern may be inserted in the fourth knowndata pattern region for each data group. In this case, the block decoder1005 of the receiving system may obtain the SCCC mode information fromthe fourth known data pattern region prior to performing a decodingprocess in accordance with the corresponding SCCC mode.

Meanwhile, in order to acquire an initial carrier wave frequencysynchronization signal, a plurality of first known data patterns aresequentially inserted in the first known data pattern region (i.e., ACQTS region) of the first known data region. For example, one first knowndata pattern is assigned to 576 symbols. Therefore, a plurality of thefirst known data pattern of 576 symbols used for the acquisition of theinitial carrier wave frequency synchronization signal, shown in FIG. 8,are sequentially inserted in the first known data pattern region.

A second known data region positioned after approximately 16 segmentsfrom the first known data region includes a trellis memoryinitialization data region (i.e., red region), a third known datapattern region (i.e., diagonally striped blue region), and a secondknown data pattern region (i.e., CIR TS region). For example, thetrellis memory initialization data region (i.e., red region) of thesecond known data region corresponds to a region having 24 symbolsassigned thereto and having data used for the initialization of thetrellis memory inserted therein. The third known data pattern region(i.e., diagonally striped blue region) corresponds to a region assignedin reserve so as to enable the second known data pattern to maintain thesame interval as the second known data pattern of another known dataregion. A third known data pattern included in the third known datapattern region may either be used by the receiving system or be left inreserve for future usage. Also, in the second known data pattern region(i.e., CIR TS region), 1424 symbols are assigned, and a second knowndata pattern that can be used for channel equalization is inserted. Thestarting point within the segment of the second known data patternregion is the same for all known data regions.

A third known data region positioned after approximately 16 segmentsfrom the second known data region includes a trellis memoryinitialization data region (i.e., red region), and a second known datapattern region (i.e., CIR TS region). The trellis memory initializationdata region (i.e., red region) within the third known data regionincludes 12 bytes. Herein, for each byte, only 2 symbols are used forthe initialization of the trellis memory. Therefore, the remaining 2symbols within each byte (i.e., the remaining 24 symbols of the trellismemory initialization data region) may be used for channel equalization.

In the above-described data structure, 11892 symbols of general data maybe inserted between the field synchronization region and the first knowndata region, thereby being transmitted. 10480 symbols of general datamay be inserted between the first known data region and the second knowndata region, thereby being transmitted. And, 11888 symbols of generaldata may be inserted between the second known data region and the thirdknown data region, thereby being transmitted. The general datacorresponds to the remaining data excluding the data of the fieldsynchronization and known data regions. For example, the general datacorrespond to the main service data, the mobile service data, the RSparity data, the MPEG header data, and so on.

FIGS. 9( a) to 9(c) illustrate a data structure (arrangement) oftransmission (Tx) parameters included in a mobile service data region assignaling data. FIG. 9( a) illustrates signaling data having a length of4 bytes. The signaling data include various information specifying aservice identifier (ID) with respect to a program, an RS mode forregions A and B shown in FIG. 7A, an RS mode for region C shown in FIG.7A, a super frame size (SFS), a permuted frame index (PFI) indicating alocation of an RS frame in a super frame, a burst size, a group index(G1) indicating an index of a data group, and a time to a next burst(TNB). FIG. 9( a) illustrates an example of the above-describedinformation being assigned to have the size of 4 bytes, and the size ofeach information are indicated in an array order within parentheses.

FIGS. 9( b) and 9(c) illustrate signal arrangements, when the signalingdata of FIG. 9( a) are positioned in the signal frame shown in FIG. 7A.If an error correction mode for region A in the signal frame is a ½ rateSCCC mode (hereinafter, error correction mode 1), region A may include afirst data region having 4-byte signaling data, a second data regionhaving 4-byte duplicated signaling data, and a third data region having24-byte RS parity data, as shown in FIG. 9( b). Alternatively, if theerror correction mode for region A is a ¼ rate SCCC mode (hereinafter,error correction mode 2), region A may include a first data regionhaving 4-byte signaling data and a second data region having 12-byte RSparity data, as shown in FIG. 9( c).

FIG. 10 illustrates an exemplary arrangement of the signaling data shownin FIG. 9 being inserted in a data group. The signaling data shown inFIG. 9 may be multiplexed with mobile service data in region A. FIG. 10illustrates exemplary positions of the signaling information, when themultiplexed mobile service data and signaling information areinterleaved by the data interleaver included in the transmitting system.If mobile service data including the transmission parameters shown inFIG. 9( b) are encoded in error correction mode 1 (i.e., at a ½-codingrate) and interleaved, among the 32 data bytes of FIG. 9( b), 6 bytesmay be placed in sub-region A1 (i.e., between the field synchronizationregion and the first known data region), and 8 bytes may be placed insub-region A2 (i.e., between the first known data region and the secondknown data region). Also, among the 32 data bytes of FIG. 9( b), 6 bytesof transmission parameters (e.g., including the RS parity data of thetransmission parameters) may be placed in sub-regions A3, A4, and A5,respectively. On the other hand, if mobile service data including the16-byte data shown in FIG. 9( c) are encoded in error correction mode 2(i.e., at a ¼-coding rate), 3 bytes may be placed in sub-region A1(i.e., between the field synchronization region and the first known dataregion), and 4 bytes may be placed in sub-region A2 (i.e., between thefirst known data region and the second known data region). Then, 3 bytesof transmission parameters (e.g., including the RS parity data of thetransmission parameters) may be placed in sub-regions A3, A4, and A5,respectively.

In a broadcasting system, the broadcast receiving system can obtain thetransmission parameters from the mobile service data by protocol with abroadcast transmitting system. And, prior to a decoding process basedupon an SCCC mode, the receiving system may acquire (or obtain)signaling information predetermined in the known data region or fieldsynchronization region shown in FIG. 8. Furthermore, the receivingsystem may also acquire (or obtain) burst information from the signalinginformation shown in FIG. 9, thereby receiving only the signals includedin the corresponding burst.

Meanwhile, the output of the group formatter 304 is inputted to the datadeinterleaver 305. And, the data deinterleaver 305 deinterleaves data byperforming an inverse process of the data interleaver on the data anddata place holders within the data group, which are then outputted tothe packet formatter 306. More specifically, when the data and dataplace holders within the data group configured, as shown in FIG. 7A, aredeinterleaved by the data deinterleaver 305, the data group beingoutputted to the packet formatter 306 is configured to have thestructure shown in FIG. 7B.

The packet formatter 306 removes the main service data place holders andthe RS parity place holders that were previously assigned for thedeinterleaving process from the deinterleaved data being inputted. Then,the packet formatter 306 groups the remaining portion and replaces the4-byte MPEG header place holder with an MPEG header having a null packetPID (or an unused PID from the main service data packet). Also, when thegroup formatter 304 inserts known data place holders, the packetformatter 306 may insert actual known data in the known data placeholders, or may directly output the known data place holders without anymodification in order to make replacement insertion in a later process.Thereafter, the packet formatter 306 identifies the data within thepacket-formatted data group, as described above, as a 188-byte unitmobile service data packet (i.e., MPEG TS packet), which is thenprovided to the packet multiplexer 240.

The packet multiplexer 240 multiplexes the mobile service data packetoutputted from the pre-processor 230 and the main service data packetoutputted from the packet jitter mitigator 220 in accordance with apre-defined multiplexing method. Then, the packet multiplexer 240outputs the multiplexed data packets to the data randomizer 251 of thepost-processor 250. Herein, the multiplexing method may vary inaccordance with various variables of the system design. One of themultiplexing methods of the packet formatter 240 consists of providing aburst section along a time axis, and, then, transmitting a plurality ofdata groups during a burst-on section within the burst section, andtransmitting only the main service data during the burst-off sectionwithin the burst section. Herein, the burst section indicates thesection starting from the beginning of the current burst until thebeginning of the next burst.

At this point, the main service data may be transmitted during theburst-on section. The packet multiplexer 240 refers to the transmissionparameter, such as information on the burst size or the burst period, soas to be informed of the number of data groups and the period of thedata groups included in a single burst. Herein, the mobile service dataand the main service data may co-exist in the burst-on section, and onlythe main service data may exist in the burst-off section. Therefore, amain data service section transmitting the main service data may existin both burst-on and burst-off sections. At this point, the main dataservice section within the burst-on section and the number of mainservice data packets included in the burst-off section may either bedifferent from one another or be the same.

When the mobile service data are transmitted in a burst structure, thereceiving system receiving only the mobile service data turns the poweron only during the burst section, thereby receiving the correspondingdata. Alternatively, in the section transmitting only the main servicedata, the power is turned off so that the main service data are notreceived in this section. Thus, the power consumption of the receivingsystem may be reduced. Such characteristic is advantageous in mobile orportable receivers that require low power consumption.

FIGS. 11( a) and 11(b) illustrate examples of acquiring mobile servicedata included in a particular data group within a burst according to thepresent invention. Referring to FIG. 11, the data group is configured ofa plurality of consecutive mobile service data packets. And, a pluralityof data groups are grouped to form a burst-on section. For simplicity,it will be assumed that a burst-on section of FIGS. 11( a) and 11(b)includes a program associated with a particular service. Referring toFIGS. 11( a) and 11(b), a time to next burst (TNB) indicates the timefrom each data group within a current burst (burst 1) to the startingpoint of the next burst (burst 2).

According to the present invention, the TNB is inserted and transmittedin each data group of the current burst. Then, the TNB is inserted in apre-decided region within the data group. For example, the TNBinformation may be inserted in the fourth known data pattern region ofthe first known data region as signaling information, as shown in FIG. 8and FIG. 9. As shown in FIG. 11( a), the TNB may gradually decrease fromdata group G1 of the current burst (burst 1) to G2 and G3 (i.e.,TNBG1>TNBG2>TNBG3). At this point, the TNB is repeatedly inserted ineach data group so that the TNB can be known by receiving other datagroups even when an error occurs during the reception of a specific datagroup in the receiving system.

FIGS. 12( a) to 12(c) illustrate other examples of acquiring mobileservice data included in a particular data group within a burstaccording to the present invention. Referring to FIGS. 12( a) to 12(c),two types of mobile service data are multiplexed with main service datapackets. As shown in FIGS. 12( a) to 12(c), a first mobile serviceproviding mobile service data will be indicated as “mo1”, and a secondmobile service providing mobile service data will be indicated as “mo2”.More specifically, each of mo1 and mo2 signifies a data group of thefirst mobile service and a data group of the second mobile service,respectively. As shown in FIG. 12, each the data (mo1) of the firstmobile service and the data (mo2) of the second mobile service aremultiplexed and outputted in data group units. Herein, the burst sectionmay be independently applied for each mobile service type. Morespecifically, among the data groups G1, G2, G3, and G4, G1 and G3correspond to the data group of the first mobile service, and G2 and G4correspond to the data group of the second mobile service. Therefore,the burst section of the first mobile service starts from the startingpoint of G1 and ends at the ending point of G3. And, the burst sectionof the second mobile service starts from the starting point of G2 andends at the ending point of G4.

In other words, the TNBs respectively inserted in data groups G1 and G3of the first mobile service (i.e., TNBG1 and TNBG3) indicate the time tothe starting point of the next first mobile service. And, the TNBsrespectively inserted in data groups G2 and G4 of the second mobileservice (i.e., TNBG2 and TNBG4) indicate the time to the starting pointof the next second mobile service. Also, various types of transmissionparameters, such as the time to next burst (TNB), the length of eachdata group, the time to a current group to the next group within aburst, and the burst length, may either be given pre-decided values orbe given values that may vary in real-time. For example, thetransmission parameters may be inserted in the fourth known data patternregion of the first known data region as signaling information, as shownin FIG. 8 and FIG. 9.

Detailed Embodiments of the RS Frame Structure and Packet Multiplexing

Hereinafter, detailed embodiments of the pre-processor 230 and thepacket multiplexer 240 will now be described. According to an embodimentof the present invention, the N value corresponding to the length of arow, which is included in the RS frame that is configured by the RSframe encoder 302, is set to 538. Accordingly, the RS frame encoder 302receives 538 transport stream (TS) packets so as to configure a first RSframe having the size of 538*187 bytes. Thereafter, as described above,the first RS frame is processed with a (235,187)-RS encoding process soas to configure a second RS frame having the size of 538*235 bytes.Finally, the second RS frame is processed with generating a 16-bitchecksum so as to configure a third RS frame having the sizes of540*235.

For example, it is assumed that the mobile service data that are to beinserted in sub-regions A1 to A5 within region A are encoded at a codingrate of ½ by the block processor 303, and that the mobile service datathat are to be inserted in sub-regions B1 and B2 within region B areencoded at a coding rate of ¼ by the block processor 303. It is alsoassumed that the mobile service data being inserted to regions A and Bcorrespond to the same type of mobile service data.

Accordingly, as shown in FIG. 7A, the sum of the number of bytes ofsub-regions A1 to A5 of region A, in which ½-rate encoded mobile servicedata are to be inserted, among the plurality of regions within the datagroup is equal to 13024 bytes (=2428+2580+2772+2472+2772 bytes). Herein,the number of byte prior to performing the ½-rate encoding process isequal to 6512 (=13024/2). On the other hand, the sum of the number ofbytes of sub-regions B1 and B2 of region B, in which ¼-rate encodedmobile service data are to be inserted, among the plurality of regionswithin the data group is equal to 2280 bytes (=930+1350 bytes). Herein,the number of byte prior to performing the ¼-rate encoding process isequal to 570 (=2280/4).

In other words, when 7082 bytes of mobile service data are inputted tothe block processor 303, 6512 byte are expanded to 13024 bytes by being½-rate encoded, and 570 bytes are expanded to 2280 bytes by being ¼-rateencoded. Thereafter, the block processor 303 inserts the mobile servicedata expanded to 13024 bytes in sub-regions A1 to A5 of region A and,also, inserts the mobile service data expanded to 2280 bytes insub-regions B1 and B2 of region B. Herein, the 7082 bytes of mobileservice data being inputted to the block processor 303 may be dividedinto output data of the RS frame encoder 302 and signaling information.In the present invention, among the 7082 bytes of mobile service data,7050 bytes correspond to the output data of the RS frame encoder 302,and the remaining 32 bytes correspond to the signaling information data.Then, ½-rate encoding or ¼-rate encoding is performed on thecorresponding data bytes.

Meanwhile, a RS frame being processed with RS encoding and CRC encodingfrom the RS frame encoder 302 is configured of 540*235 bytes, in otherwords, 126900 bytes. The 126900 bytes are divided by 7050-byte unitsalong the time axis, so as to produce 18 7050-byte units. Thereafter, a32-byte unit of signaling information data is added to the 7050-byteunit mobile service data being outputted from the RS frame encoder 302.Subsequently, the RS frame encoder 302 performs ½-rate encoding or¼-rate encoding on the corresponding data bytes, which are thenoutputted to the group formatter 304. Accordingly, the group formatter304 inserts the ½-rate encoded data in region A and the ¼-rate encodeddata in region B.

The process of deciding an N value that is required for configuring theRS frame from the RS frame encoder 302 will now be described in detail.More specifically, the size of the final RS frame (i.e., the third RSframe), which is RS encoded and CRC encoded from the RS frame encoder302, which corresponds to (N+2)*235 bytes should be assigned to X numberof groups, wherein X is an integer. Herein, in a single data group, 7050data bytes prior to being encoded are allocated. Therefore, if the(N+2)*235 bytes are set to be the exact multiple of 7050(=30*235), theoutput data of the RS frame encoder 302 may be efficiently allocated tothe data group. According to an embodiment of the present invention, thevalue of N is decided so that (N+2) becomes a multiple of 30. Forexample, in the present invention, N is equal to 538, and (N+2) (=540)divided by 30 is equal to 18. This indicates that the mobile servicedata within one RS frame are processed with either ½-rate encoding or¼-rate encoding. The encoded mobile service data are then allocated to18 data groups.

FIG. 13 illustrates a process of dividing the RS frame according to thepresent invention. More specifically, the RS frame having the size of(N+2)*235 is divided into 30*235 byte blocks. Then, the divided blocksare mapped to a single group. In other words, the data of a block havingthe size of 30*235 bytes are processed with one of a ½-rate encodingprocess and a ¼-rate encoding process and are, then, inserted in a datagroup.

In another example, it is assumed that the mobile service data that areto be inserted in region C are ½-rate encoded by the block processor303, and that the mobile service data that are to be inserted in regionC correspond to a mobile service data type different from that of themobile service data that are inserted in regions A and B. In this case,as shown in FIG. 7A, the total number of ½-rate encoded mobile servicedata bytes that are to be included in sub-regions C1 to C3 of region Cis equal to 4144 bytes (i.e., 4144=1272+1560+1312). In this case, thetotal number of mobile service data bytes prior to being ½-rate encodedis equal to 2072 bytes (i.e., 2072=4144/2). At this point, when it isassumed that 18 data groups are grouped to form a RS frame, and that themobile service data of the RS frame are inserted into the region C, theRS frame is configured of 37296 bytes. Herein, the number of RS paritybytes P is set to be equal to 36 (i.e., P=36), and 2 CRC checksums areset to be included for each row. Accordingly, a total of 165 188-bytemobile service data packets may be transmitted for each RS frame.

In this case, 55 bytes may remain for each RS frame of the region Cwithin the data group. Remaining data bytes may occur, when dividingeach RS frame into a plurality of data groups having the same size. Morespecifically, remaining data bytes may occur in particular regions ineach RS frame depending upon the size of the RS frames, the size andnumber of divided data groups, the number of mobile service data bytesthat may be inserted into each data group, the coding rate of thecorresponding region, the number of RS parity bytes, whether or not aCRC checksum has been allocated, and, if any, the number of CRCchecksums allocated.

When dividing the RS frame into a plurality of data groups having thesame size, and when remaining data bytes occur in the corresponding RSframe, K number of dummy bytes are added to the corresponding RS frame,wherein K is equal to the number of remaining data bytes within the RSframe. Then, the dummy byte-added RS frame is divided into a pluralityof data groups. This process is illustrated in FIG. 14. Morespecifically, FIG. 14 illustrates an example of processing K number ofremaining data bytes, which are produced by dividing the RS frame havingthe size of (N+2)*(187+P) bytes into M number of data groups havingequal sizes. In this case, as shown in FIG. 14( a), K number of dummybytes are added to the RS frame having the size of (N+2)*(187+P) bytes.Subsequently, the RS frame is read in row units, thereby being dividedinto M number of data groups, as shown in FIG. 14( b). At this point,each data group has the size of NoBytesPerGrp bytes. This may bedescribed by Equation 3 shown below.

M×NoBytesPeGrp=(N+2)×(187+P)×K  Equation 3

Herein, NoBytesPerGrp indicates the number of bytes allocated for eachgroup (i.e., the Number of Bytes Per Group). More specifically, the sizecorresponding to the number of bytes in one RS frame+K bytes is equal tothe size of the M number of data groups.

When the mobile service data are transmitted by using theabove-described method and transmission mode, the data randomizer 301 ofthe pre-processor 230 may receive the mobile service data packetsthrough a first mobile service data path and a second mobile servicedata path, to which data that are to be assigned to regions A and B areinputted. More specifically, 538 data packets are inputted to the firstmobile service data path, and 165 data packets are inputted to thesecond mobile service data path. In order to do so, a plurality of datarandomizers and RS frame encoders may be provided. Accordingly, the 538data packets being inputted to the first mobile service data path andthe 165 data packets being inputted to the second mobile service datapath are randomized by each respective data randomizer. Then, each RSframe encoder performs RS frame unit encoding and super frame unit rowpermutation processes on the inputted data packets. Thereafter, theprocessed data packets are divided back to RS frame units, thereby beinginputted to the block processor 303.

For example, the RS frame encoder encoding the data being inputtedthrough the first mobile service data path adds 48 parity bytes in acolumn direction to the corresponding RS frame. This RS frame encoderalso adds a 2-byte CRC checksum in a row direction to the correspondingRS frame. The RS frame encoder encoding the data being inputted throughthe second mobile service data path adds 36 parity bytes in a columndirection to the corresponding RS frame. This RS frame encoder also addsa 2-byte CRC checksum in a row direction to the corresponding RS frame.

The block processor 303 performs ½-rate encoding on the data that are tobe assigned to regions A and C. And, the block processor 303 performs¼-rate encoding on the data that are to be assigned to region B. Theblock processor 303 then outputs the encoded data to the group formatter304.

At this point, since 55 bytes remain in region C included in the datagroup for each RS frame, as described above, the block processor 303adds 55 dummy bytes to region C, once all data that are to be assignedto region C are inputted. Thereafter, the block processor 303 ½-rateencodes the processed data. Herein, the dummy bytes may be added by theblock processor 303, as described above, or may be added by an externalblock (not shown).

The group formatter 304 inserts (or allocates) the ½-rate or ¼-rateencoded and inputted mobile service data and known data (e.g., MPEGheader place holders, non-systematic RS parity place holders,initialization data place holders, etc.) to the respective regionswithin the data group shown in FIG. 7A. For example, the mobile servicedata that are inputted through the first mobile service data path andthen ½-rate or ¼-rate encoded are inserted in regions A and B. And, themobile service data that are inputted through the second mobile servicedata path and then ½-rate encoded are inserted in region C.

FIG. 15 illustrates detailed exemplary operations of the packetmultiplexer 240 according to an embodiment of the present invention.More specifically, the packet multiplexer 240 multiplexes data fieldsincluding a data group and data fields only including main service dataand outputs the randomized data to the data randomizer 251. According tothe present invention, the data fields including a data group aretransmitted to a burst-on section. And, the data fields including onlythe main service data are transmitted to a burst-off section. At thispoint, the burst-on section may also transmit the main service data. Atthis point, in order to transmit the RS frame having the size of 540*235bytes, 18 data groups should be transmitted. Herein, each data groupincludes field synchronization data, as shown in FIG. 7A. Therefore, the18 data groups are transmitted during 18 field sections, and the sectionduring which the 18 data groups are being transmitted corresponds to theburst-on section.

In each field within the burst-on section, a data group including fieldsynchronization data is multiplexed with main service data, which arethen outputted. For example, in the embodiment of the present invention,in each field within the burst-on section, a data group having the sizeof 118 segments is multiplexed with a set of main service data havingthe size of 194 segments. Referring to FIG. 15, during the burst-onsection (i.e., during the 18 field sections), a field including 18 datagroups is transmitted. Then, during the burst-off section that follows(i.e., during the 12 field sections), a field consisting only of themain service data is transmitted. Subsequently, during a subsequentburst-on section, 18 fields including 18 data groups are transmitted.And, during the following burst-off section, 12 fields consisting onlyof the main service data are transmitted.

Furthermore, in the present invention, the same type of data service maybe provided in the first burst-on section including the first 18 datagroups and in the second burst-on section including the next 18 datagroups. Alternatively, different types of data service may be providedin each burst-on section. For example, when it is assumed that differentdata service types are provided to each of the first burst-on sectionand the second burst-on section of FIG. 15, and that the receivingsystem wishes to receive only one type of data service, the receivingsystem turns the power on only during the corresponding burst-on sectionincluding the desired data service type so as to receive thecorresponding 18 data fields. Then, the receiving system turns the poweroff during the remaining 42 field sections so as to prevent other dataservice types from being received. Thus, the amount of power consumptionof the receiving system may be reduced. In addition, the receivingsystem according to the present invention is advantageous in that one RSframe may be configured from the 18 data groups that are received duringa single burst-on section.

According to the present invention, the number of data groups includedin a burst-on section may vary based upon the size of the RS frame, andthe size of the RS frame varies in accordance with the value N. Morespecifically, by adjusting the value N, the number of data groups withinthe burst section may be adjusted. Herein, in an example of the presentinvention, the (235,187)-RS encoding process adjusts the value N duringa fixed state. Furthermore, the size of the mobile service data that canbe inserted in the data group may vary based upon the sizes of thetrellis initialization data or known data, the MPEG header, and the RSparity, which are inserted in the corresponding data group.

Meanwhile, since a data group including mobile service data in-betweenthe data bytes of the main service data during the packet multiplexingprocess, the shifting of the chronological position (or place) of themain service data packet becomes relative. Also, a system object decoder(i.e., MPEG decoder) for processing the main service data of thereceiving system, receives and decodes only the main service data andrecognizes the mobile service data packet as a null data packet.Therefore, when the system object decoder of the receiving systemreceives a main service data packet that is multiplexed with the datagroup, a packet jitter occurs.

At this point, since a multiple-level buffer for the video data existsin the system object decoder and the size of the buffer is relativelylarge, the packet jitter generated from the packet multiplexer 240 doesnot cause any serious problem in case of the video data. However, sincethe size of the buffer for the audio data is relatively small, thepacket jitter may cause considerable problem. More specifically, due tothe packet jitter, an overflow or underflow may occur in the buffer forthe main service data of the receiving system (e.g., the buffer for theaudio data). Therefore, the packet jitter mitigator 220 re-adjusts therelative position of the main service data packet so that the overflowor underflow does not occur in the system object decoder.

In the present invention, examples of repositioning places for the audiodata packets within the main service data in order to minimize theinfluence on the operations of the audio buffer will be described indetail. The packet jitter mitigator 220 repositions the audio datapackets in the main service data section so that the audio data packetsof the main service data can be as equally and uniformly aligned andpositioned as possible. The standard for repositioning the audio datapackets in the main service data performed by the packet jittermitigator 220 will now be described. Herein, it is assumed that thepacket jitter mitigator 220 knows the same multiplexing information asthat of the packet multiplexer 240, which is placed further behind thepacket jitter mitigator 220.

Firstly, if one audio data packet exists in the main service datasection (e.g., the main service data section positioned between two datagroups) within the burst-on section, the audio data packet is positionedat the very beginning of the main service data section. Alternatively,if two audio data packets exist in the corresponding data section, oneaudio data packet is positioned at the very beginning and the otheraudio data packet is positioned at the very end of the main service datasection. Further, if more than three audio data packets exist, one audiodata packet is positioned at the very beginning of the main service datasection, another is positioned at the very end of the main service datasection, and the remaining audio data packets are equally positionedbetween the first and last audio data packets. Secondly, during the mainservice data section placed immediately before the beginning of aburst-on section (i.e., during a burst-off section), the audio datapacket is placed at the very end of the corresponding section.

Thirdly, during a main service data section within the burst-off sectionafter the burst-on section, the audio data packet is positioned at thevery end of the main service data section. Finally, the data packetsother than audio data packets are positioned in accordance with theinputted order in vacant spaces (i.e., spaces that are not designatedfor the audio data packets). Meanwhile, when the positions of the mainservice data packets are relatively re-adjusted, associated programclock reference (PCR) values may also be modified accordingly. The PCRvalue corresponds to a time reference value for synchronizing the timeof the MPEG decoder. Herein, the PCR value is inserted in a specificregion of a TS packet and then transmitted. In the example of thepresent invention, the packet jitter mitigator 220 also performs theoperation of modifying the PCR value.

The output of the packet jitter mitigator 220 is inputted to the packetmultiplexer 240. As described above, the packet multiplexer 240multiplexes the main service data packet outputted from the packetjitter mitigator 220 with the mobile service data packet outputted fromthe pre-processor 230 into a burst structure in accordance with apre-determined multiplexing rule. Then, the packet multiplexer 240outputs the multiplexed data packets to the data randomizer 251 of thepost-processor 250. If the inputted data correspond to the main servicedata packet, the data randomizer 251 performs the same randomizingprocess as that of the conventional randomizer. More specifically, thesynchronization byte within the main service data packet is deleted.Then, the remaining 187 data bytes are randomized by using a pseudorandom byte generated from the data randomizer 251. Thereafter, therandomized data are outputted to the RS encoder/non-systematic RSencoder 252.

On the other hand, if the inputted data correspond to the mobile servicedata packet, the data randomizer 251 may randomize only a portion of thedata packet. For example, if it is assumed that a randomizing processhas already been performed in advance on the mobile service data packetby the pre-processor 230, the data randomizer 251 deletes thesynchronization byte from the 4-byte MPEG header included in the mobileservice data packet and, then, performs the randomizing process only onthe remaining 3 data bytes of the MPEG header. Thereafter, therandomized data bytes are outputted to the RS encoder/non-systematic RSencoder 252. More specifically, the randomizing process is not performedon the remaining portion of the mobile service data excluding the MPEGheader. In other words, the remaining portion of the mobile service datapacket is directly outputted to the RS encoder/non-systematic RS encoder252 without being randomized. Also, the data randomizer 251 may or maynot perform a randomizing process on the known data (or known data placeholders) and the initialization data place holders included in themobile service data packet.

The RS encoder/non-systematic RS encoder 252 performs an RS encodingprocess on the data being randomized by the data randomizer 251 or onthe data bypassing the data randomizer 251, so as to add 20 bytes of RSparity data. Thereafter, the processed data are outputted to the datainterleaver 253. Herein, if the inputted data correspond to the mainservice data packet, the RS encoder/non-systematic RS encoder 252performs the same systematic RS encoding process as that of theconventional broadcasting system, thereby adding the 20-byte RS paritydata at the end of the 187-byte data. Alternatively, if the inputteddata correspond to the mobile service data packet, the RSencoder/non-systematic RS encoder 252 performs a non-systematic RSencoding process. At this point, the 20-byte RS parity data obtainedfrom the non-systematic RS encoding process are inserted in apre-decided parity byte place within the mobile service data packet.

The data interleaver 253 corresponds to a byte unit convolutionalinterleaver. The output of the data interleaver 253 is inputted to theparity replacer 254 and to the non-systematic RS encoder 255. Meanwhile,a process of initializing a memory within the trellis encoding module256 is primarily required in order to decide the output data of thetrellis encoding module 256, which is located after the parity replacer254, as the known data pre-defined according to an agreement between thereceiving system and the transmitting system. More specifically, thememory of the trellis encoding module 256 should first be initializedbefore the received known data sequence is trellis-encoded. At thispoint, the beginning portion of the known data sequence that is receivedcorresponds to the initialization data place holder and not to theactual known data. Herein, the initialization data place holder has beenincluded in the data by the group formatter within the pre-processor 230in an earlier process. Therefore, the process of generatinginitialization data and replacing the initialization data place holderof the corresponding memory with the generated initialization data arerequired to be performed immediately before the inputted known datasequence is trellis-encoded.

Additionally, a value of the trellis memory initialization data isdecided and generated based upon a memory status of the trellis encodingmodule 256. Further, due to the newly replaced initialization data, aprocess of newly calculating the RS parity and replacing the RS parity,which is outputted from the data interleaver 253, with the newlycalculated RS parity is required. Therefore, the non-systematic RSencoder 255 receives the mobile service data packet including theinitialization data place holders, which are to be replaced with theactual initialization data, from the data interleaver 253 and alsoreceives the initialization data from the trellis encoding module 256.

Among the inputted mobile service data packet, the initialization dataplace holders are replaced with the initialization data, and the RSparity data that are added to the mobile service data packet are removedand processed with non-systematic RS encoding. Thereafter, the new RSparity obtained by performing the non-systematic RS encoding process isoutputted to the parity replacer 255. Accordingly, the parity replacer255 selects the output of the data interleaver 253 as the data withinthe mobile service data packet, and the parity replacer 255 selects theoutput of the non-systematic RS encoder 255 as the RS parity. Theselected data are then outputted to the trellis encoding module 256.

Meanwhile, if the main service data packet is inputted or if the mobileservice data packet, which does not include any initialization dataplace holders that are to be replaced, is inputted, the parity replacer254 selects the data and RS parity that are outputted from the datainterleaver 253. Then, the parity replacer 254 directly outputs theselected data to the trellis encoding module 256 without anymodification. The trellis encoding module 256 converts the byte-unitdata to symbol units and performs a 12-way interleaving process so as totrellis-encode the received data. Thereafter, the processed data areoutputted to the synchronization multiplexer 260.

The synchronization multiplexer 260 inserts a field synchronizationsignal and a segment synchronization signal to the data outputted fromthe trellis encoding module 256 and, then, outputs the processed data tothe pilot inserter 271 of the transmission unit 270. Herein, the datahaving a pilot inserted therein by the pilot inserter 271 are modulatedby the modulator 272 in accordance with a pre-determined modulatingmethod (e.g., a VSB method). Thereafter, the modulated data aretransmitted to each receiving system though the radio frequency (RF)up-converter 273.

Block Processor

FIG. 16 illustrates a block diagram showing a structure of a blockprocessor according to the present invention. Herein, the blockprocessor includes a byte-bit converter 401, a symbol encoder 402, asymbol interleaver 403, and a symbol-byte converter 404. The byte-bitconverter 401 divides the mobile service data bytes that are inputtedfrom the RS frame encoder 112 into bits, which are then outputted to thesymbol encoder 402. The byte-symbol converter 401 may also receivesignaling information including transmission parameters. The signalinginformation data bytes are also divided into bits so as to be outputtedto the symbol encoder 402. Herein, the signaling information includingtransmission parameters may be processed with the same data processingstep as that of the mobile service data. More specifically, thesignaling information may be inputted to the block processor 303 bypassing through the data randomizer 301 and the RS frame encoder 302.Alternatively, the signaling information may also be directly outputtedto the block processor 303 without passing though the data randomizer301 and the RS frame encoder 302.

The symbol encoder 402 corresponds to a D/E-rate encoder encoding theinputted data from D bits to E bits and outputting the data encoded atthe coding rate of D/E. For example, when 1 input data bit is encoded to2 bits and then outputted, D is equal to 1 (i.e., D=1), and E is equalto 2 (i.e., E=2). And, when 1 input data bit is encoded to 4 bits andthen outputted, D is equal to 1 (i.e., D=1), and E is equal to 4 (i.e.,E=4). According to the embodiment of the present invention, the symbolencoder 402 performs either a coding rate of ½ (also referred to as a½-rate encoding process) or an encoding process at a coding rate of ¼(also referred to as a ¼-rate encoding process). The symbol encoder 402performs one of ½-rate encoding and ¼-rate encoding on the inputtedmobile service data and signaling information. Thereafter, the signalinginformation is also recognized as the mobile service data and processedaccordingly. The symbol encoder 402 may be operated as an encoder havingthe coding rate of ½ or may be operated as an encoder having the codingrate of ¼.

FIG. 17A to FIG. 17C illustrate block views showing exemplary operationsof the symbol encoder having the coding rate of ¼ according to anembodiment of the present invention. The symbol encoder of FIG. 17Aincludes a ¼ outer encoder 411, and a parallel/serial converter 412.Referring to FIG. 17A, the ¼ outer encoder 411 encodes a mobile servicedata bit U, which is being inputted to the ¼ outer encoder 411, to u0 tou3 (i.e., to 2 symbols). Then, the ¼ outer encoder 411 outputs the twoencoded symbols to the parallel/serial converter 412. Theparallel/serial converter 412 converts the two inputted symbols toserial symbol units, which are then serially outputted to the symbolinterleaver 403. More specifically, the parallel/serial converter 412outputs one symbol, which is configured of u0 and u1, to the symbolinterleaver 403. And, then the parallel/serial converter 412 outputsanother symbol, which is configured of u2 and u3, to the symbolinterleaver 403.

The symbol encoder of FIG. 17B includes a ½ outer encoder 421 and arepeater 422. Referring to FIG. 17B, the ½ outer encoder 421 encodes amobile service data bit U, which is being inputted to the ½ outerencoder 421, to u0 and u1 (i.e., to 1 symbol). Then, the ½ outer encoder421 outputs the encoded symbol to the repeater 422. The repeater 422repeats the ½-rate encoded symbol one time and outputs the repeatedsymbol to the symbol interleaver 403. More specifically, the repeater422 outputs the symbol configured of bit u0 and bit u1 to the symbolinterleaver 403. Then, the repeater 422 outputs the symbol configured ofbit u0 and bit u1 once again to the symbol interleaver 403.

The symbol encoder of FIG. 17C includes a repeater 431 and a ½ outerencoder 432. Referring to FIG. 17C, the repeater 431 repeats a mobileservice data bit U, which is being inputted to the repeater 431, so asto output two bits U and U to the ½ outer encoder 432. Thereafter, the ½outer encoder 432 encodes the mobile service data bit U being outputtedfrom the repeater 431, to u0 and u1 (i.e., to 1 symbol). Then, the ½outer encoder 431 outputs the encoded symbol to the symbol interleaver403. At this point, since identical mobile service data bits U aresequentially inputted to the ½ outer encoder 432 twice, the ½ outerencoder 432 performs the ½-rate encoding process twice on the mobileservice data bit U, which is being inputted to the repeater 431.

More specifically, when the symbol encoder 402 repeatedly outputs 2symbols encoded at a coding rate of ½, as shown in FIG. 17B, or when thesymbol encoder 402 performs the ½-rate encoding process two times on theinput data bit and then outputs the encoded data bit, as shown in FIG.17C, the overall coding rate becomes ¼. As described above, when thesymbol encoder 402 is operated as an encoder having a coding rate of ¼,the input data bit may be encoded at a coding rate of ¼, so that eachsymbol can be sequentially outputted one by one. Alternatively, theinput data may be encoded at a coding rate of ½ and then repeated onetime, so that each symbol can be sequentially outputted one by one.Furthermore, the input data bit may be encoded at a coding rate of ½ twotimes, so that each symbol can be sequentially outputted one by one.

Meanwhile, when the symbol encoder 402 is operated as an encoder havinga coding rate of ½, the input data bit is encoded at a coding rate of ½by the ½ outer encoder and then outputted. Alternatively, the input databit may also be encoded at a coding rate of ¼ by the ¼ outer encoder.Thereafter, when only one of the two symbols is selected and outputted,the symbol encoder 402 may be operated as an encoder having the codingrate of ½. In the description of the present invention, the ½-codingrate and the ¼-coding rate are merely exemplary, and the coding rate mayvary depending upon the selection of the encoded symbols or the numberof repetition of the symbols. Therefore, the present invention will notbe limited only to the examples given in the embodiments of the presentinvention. Nevertheless, if the coding rate is low, the actual amount ofdata that can be transmitted becomes smaller, accordingly. Therefore,these two factors should be accounted for when deciding the coding rate.

FIG. 18A illustrates a detailed block view of a ½ outer encoderaccording to an embodiment of the present invention. Referring to FIG.18A, the ½ outer encoder includes two delays (or a first delay and asecond delay) 501 and 503, and one adder 502. Herein, the ½ outerencoder encodes the input data bit U, so that 2 bits (i.e., u0 and u1)can be outputted. At this point, the input data bit U corresponds to anupper bit u0, which is outputted without modification and at the sametime encoded to be outputted as a lower bit u1. More specifically, theinput data bit U is directly outputted as the upper bit u0 withoutmodification and, simultaneously, outputted to the adder 502.

The adder 502 adds the input data bit U and the output of the firstdelay 501, which are then outputted to the second delay 503. Thereafter,the data that have been delayed by a set period of time (e.g., by 1clock) are outputted as the lower bit u1 and, at the same time, fed-backto the first delay 501. Subsequently, the first delay 501 delays datafed-back by from the second delay 503 by a set period of time (e.g., by1 clock). Then, the delayed data are outputted to the adder 502. At thispoint, if the data bit U being inputted to the symbol encoder 402corresponds to a data bit that is to be encoded at a coding rate of ¼, asymbol configured of u0u1 bits may be repeated twice and then outputted.Alternatively, the input data bit U may be repeated once, which is theninputted to the ½ outer encoder of FIG. 18A.

FIG. 18B illustrates a detailed block view of a ¼ outer encoderaccording to an embodiment of the present invention. Referring to FIG.18B, the ¼ outer encoder includes two delays (or a first delay and asecond delay) 501 and 503, and three adders 502, 504, and 505. Herein,the ¼ outer encoder encodes the input data bit U, so that 4 bits (i.e.,u0 to u3) can be outputted. At this point, the input data bit Ucorresponds to an uppermost bit u0, which is outputted withoutmodification and at the same time encoded to be outputted as lower bitu1u2u3. More specifically, the input data bit U is directly outputted asthe uppermost bit u0 and simultaneously outputted to the first and thirdadders 502 and 505. The first adder 502 adds the input data bit U andthe output bit of the first delay unit 501 and, then, outputs the addedbit to the second delay unit 503. Then, the data bit delayed by apre-determined time (e.g., by 1 clock) in the second delay unit 503 isoutputted as lower bit u1 and simultaneously fed-back to the first delayunit 501. The first delay unit 501 delays the data bit fed-back from thesecond delay unit 503 by a pre-determined time (e.g., by 1 clock). Then,the first delay unit 501 outputs the delayed data bit to the first adder502 and the second adder 504. The second adder 504 adds the data bitsoutputted from the first and second delay units 501 and 503 as a lowerbit u2. The third adder 505 adds the input data bit U and the output ofthe second delay unit 503 and outputs the added data bit as a lower bitu3.

At this point, if the input data bit U corresponds to data encoded at a½-coding rate, the symbol encoder 402 configures a symbol with u0u1 bitsfrom the 4 output bits u0u1u2u3. Then, the symbol encoder 402 outputsthe newly configured symbol. Alternatively, if the input data bit Ucorresponds to data encoded at a ¼-coding rate, the symbol encoder 402configures and outputs a symbol with bits u0u1 and, then, configures andoutputs another symbol with bits u2u3. According to another embodimentof the present invention, if the input data bit U corresponds to dataencoded at a ¼-coding rate, the symbol encoder 402 may also configureand output a symbol with bits u0u1, and then repeat the process onceagain and output the corresponding bits.

According to yet another embodiment of the present invention, the symbolencoder outputs all four output bits U u0u1u2u3. Then, when using the½-coding rate, the symbol interleaver 403 located behind the symbolencoder 402 selects only the symbol configured of bits u0u1 from thefour output bits u0u1u2u3. Alternatively, when using the ¼-coding rate,the symbol interleaver 403 may select the symbol configured of bits u0u1and then select another symbol configured of bits u2u3. According toanother embodiment, when using the ¼-coding rate, the symbol interleaver403 may repeatedly select the symbol configured of bits u0u1.

The output of the symbol encoder 402 is inputted to the symbolinterleaver 403. Then, the symbol interleaver 403 performs blockinterleaving in symbol units on the data outputted from the symbolencoder 402. Any interleaver performing structural rearrangement (orrealignment) may be applied as the symbol interleaver 403 of the blockprocessor. However, in the present invention, a variable length symbolinterleaver that can be applied even when a plurality of lengths isprovided for the symbol, so that its order may be rearranged, may alsobe used.

FIG. 19( a) to FIG. 19( c) illustrate a symbol interleaver according toan embodiment of the present invention. Herein, the symbol interleaveraccording to the embodiment of the present invention corresponds to avariable length symbol interleaver that may be applied even when aplurality of lengths is provided for the symbol, so that its order maybe rearranged. Particularly, FIG. 19( a) to FIG. 19( c) illustrate anexample of the symbol interleaver when BK=6 and BL=8. Herein, BKindicates a number of symbols that are outputted for symbol interleavingfrom the symbol encoder 402. And, BL represents a number of symbols thatare actually interleaved by the symbol interleaver 403.

In the present invention, the symbol interleaver 403 should satisfy theconditions of BL=2^(n) (wherein n is an integer) and of BL≧BK. If thereis a difference in value between BK and BL, (BL−BK) number of null (ordummy) symbols is added, thereby creating an interleaving pattern.Therefore, BK becomes a block size of the actual symbols that areinputted to the symbol interleaver 403 in order to be interleaved. BLbecomes an interleaving unit when the interleaving process is performedby an interleaving pattern created from the symbol interleaver 403.

The example of what is described above is illustrated in FIG. 19( a) toFIG. 19( c). The number of symbols outputted from the symbol encoder 402in order to be interleaved is equal to 6 (i.e., BK=6). In other words, 6symbols are outputted from the symbol encoder 402 in order to beinterleaved. And, the actual interleaving unit (BL) is equal to 8symbols. Therefore, as shown in FIG. 19( a), 2 symbols are added to thenull (or dummy) symbol, thereby creating the interleaving pattern.Equation 4 shown below described the process of sequentially receivingBK number of symbols, the order of which is to be rearranged, andobtaining an BL value satisfying the conditions of BL=2^(n) (wherein nis an integer) and of BL≧BK, thereby creating the interleaving so as torealign (or rearrange) the symbol order.

In relation to all places, wherein 0≦i≦BL−1,

P(i)={S×i×(i+1)/2} mod BL  Equation 4

Herein, BL≧BK, BL=2^(n), and n and S are integers. FIG. 12 shows anexample of an interleaving pattern and an interleaving process, whereinit is assumed that S is equal to 89, and that BL is equal to 8. As shownin FIG. 19( b), the order of BK number of input symbols and (BL-BK)number of null symbols is rearranged by using the above-mentionedEquation 4. Then, as shown in FIG. 19( c), the null byte places areremoved, so as to rearrange the order, by using Equation 5 shown below.Thereafter, the symbol that is interleaved by the rearranged order isthen outputted to the symbol-byte converter.

if P(i)>BK−1, then P(i) place is removed and rearranged  Equation 5

Subsequently, the symbol-byte converter 404 converts to bytes the mobileservice data symbols, having the rearranging of the symbol ordercompleted and then outputted in accordance with the rearranged orderfrom the symbol interleaver 403, and thereafter outputs the convertedbytes to the group formatter 304.

FIG. 20A illustrates a block diagram showing the structure of a blockprocessor according to another embodiment of the present invention.Herein, the block processor includes an interleaving unit 610 and ablock formatter 620. The interleaving unit 610 may include a byte-symbolconverter 611, a symbol-byte converter 612, a symbol interleaver 613,and a symbol-byte converter 614. Herein, the symbol interleaver 613 mayalso be referred to as a block interleaver.

The byte-symbol converter 611 of the interleaving unit 610 converts themobile service data X outputted in byte units from the RS frame encoder302 to symbol units. Then, the byte-symbol converter 611 outputs theconverted mobile service data symbols to the symbol-byte converter 612and the symbol interleaver 613. More specifically, the byte-symbolconverter 611 converts each 2 bits of the inputted mobile service databyte (=8 bits) to 1 symbol and outputs the converted symbols. This isbecause the input data of the trellis encoding module 256 consist ofsymbol units configured of 2 bits. The relationship between the blockprocessor 303 and the trellis encoding module 256 will be described indetail in a later process. At this point, the byte-symbol converter 611may also receive signaling information including transmissionparameters. Furthermore, the signaling information bytes may also bedivided into symbol units and then outputted to the symbol-byteconverter and the symbol interleaver 613.

The symbol-byte converter 612 groups 4 symbols outputted from thebyte-symbol converter 611 so as to configure a byte. Thereafter, theconverted data bytes are outputted to the block formatter 620. Herein,each of the symbol-byte converter 612 and the byte-symbol converter 611respectively performs an inverse process of one another. Therefore, theyields (or results) of these two blocks are offset. Accordingly, asshown in FIG. 20B, the input data X bypass the byte-symbol converter 611and the symbol-byte converter and are directly inputted to the blockformatter 620. More specifically, the interleaving unit 610 of FIG. 20Bhas a structure equivalent to that of the interleaving unit shown inFIG. 20A. Therefore, the same reference numerals will be used in FIG.20A and FIG. 20B.

The symbol interleaver 613 performs block interleaving in symbol unitson the data that are outputted from the byte-symbol converter 611.Subsequently, the symbol interleaver outputs the interleaved data to thesymbol-byte converter 614. Herein, any type of interleaver that canrearrange the structural order may be used as the symbol interleaver 613of the present invention. In the example given in the present invention,a variable length interleaver that may be applied for symbols having awide range of lengths, the order of which is to be rearranged. Forexample, the symbol interleaver of FIG. 19 may also be used in the blockprocessor shown in FIG. 20A and FIG. 20B.

The symbol-byte converter 614 outputs the symbols having the rearrangingof the symbol order completed by the symbol interleaver 613, inaccordance with the rearranged order. Thereafter, the symbols aregrouped to be configured in byte units, which are then outputted to theblock formatter 620. More specifically, the symbol-byte converter 614groups 4 symbols outputted from the symbol interleaver 613 so as toconfigure a data byte. As shown in FIG. 21, the block formatter 620performs the process of aligning the output of each symbol-byteconverter 612 and 614 within the block in accordance with a setstandard. Herein, the block formatter 620 operates in association withthe trellis encoding module 256.

More specifically, the block formatter 620 decides the output order ofthe mobile service data outputted from each symbol-byte converter 612and 614 while taking into consideration the place (or order) of the dataexcluding the mobile service data that are being inputted, wherein themobile service data include main service data, known data, RS paritydata, and MPEG header data.

According to the embodiment of the present invention, the trellisencoding module 256 is provided with 12 trellis encoders. FIG. 22illustrates a block diagram showing the trellis encoding module 256according to the present invention. In the example shown in FIG. 22, 12identical trellis encoders are combined to the interleaver in order todisperse noise. Herein, each trellis encoder may be provided with apre-coder.

FIG. 23A illustrates the block processor 303 being concatenated with thetrellis encoding module 256. In the transmitting system, a plurality ofblocks actually exists between the pre-processor 230 including the blockprocessor and the trellis encoding module 256, as shown in FIG. 3.Conversely, the receiving system considers the pre-processor to beconcatenated with the trellis encoding module 256, thereby performingthe decoding process accordingly. However, the data excluding the mobileservice data that are being inputted to the trellis encoding module 256,wherein the mobile service data include main service data, known data,RS parity data, and MPEG header data, correspond to data that are addedto the blocks existing between the block processor and the trellisencoding module 256. FIG. 23B illustrates an example of a data processor650 being positioned between the block processor 303 and the trellisencoding module 256, while taking the above-described instance intoconsideration.

Herein, when the interleaving unit 610 of the block processor 303performs a ½-rate encoding process, the interleaving unit 610 may beconfigured as shown in FIG. 20A (or FIG. 20B). Referring to FIG. 3, forexample, the data processor 650 may include a group formatter 304, adata deinterleaver 305, a packet formatter 306, and a packet multiplexer240, and a data randomizer 251, a RS encoder/non-systematic RS encoder252, a data interleaver 253, a parity replacer 254, and a non-systematicRS encoder 255 of a post-processor 250.

At this point, the trellis encoding module 256 symbolizes the data thatare being inputted so as to divide the symbolized data and to send thedivided data to each trellis encoder in accordance with a pre-definedmethod. Herein, one byte is converted into 4 symbols, each beingconfigured of 2 bits. Also, the symbols created from the single databyte are all transmitted to the same trellis encoder. Accordingly, eachtrellis encoder pre-codes an upper bit of the input symbol, which isthen outputted as the uppermost output bit C2. Alternatively, eachtrellis encoder trellis-encodes a lower bit of the input symbol, whichis then outputted as two output bits C1 and C0. The block formatter 620is controlled so that the data byte outputted from each symbol-byteconverter can be transmitted to different trellis encoders.

Hereinafter, the operation of the block formatter 620 will now bedescribed in detail with reference to FIG. 16 to FIG. 20. Referring toFIG. 20A, for example, the data byte outputted from the symbol-byteconverter 612 and the data byte outputted from the symbol-byte converter614 are inputted to different trellis encoders of the trellis encodingmodule 256 in accordance with the control of the block formatter 620.Hereinafter, the data byte outputted from the symbol-byte converter 612will be referred to as X, and the data byte outputted from thesymbol-byte converter 614 will be referred to as Y, for simplicity.Referring to FIG. 21( a), each number (i.e., 0 to 11) indicates thefirst to twelfth trellis encoders of the trellis encoding module 256,respectively.

In addition, the output order of both symbol-byte converters arearranged (or aligned) so that the data bytes outputted from thesymbol-byte converter 612 are respectively inputted to the 0^(th) to5^(th) trellis encoders (0 to 5) of the trellis encoding module 256, andthat the data bytes outputted from the symbol-byte converter 614 arerespectively inputted to the 6^(th) to 11^(th) trellis encoders (6 to11) of the trellis encoding module 256. Herein, the trellis encodershaving the data bytes outputted from the symbol-byte converter 612allocated therein, and the trellis encoders having the data bytesoutputted from the symbol-byte converter 614 allocated therein aremerely examples given to simplify the understanding of the presentinvention. Furthermore, according to an embodiment of the presentinvention, and assuming that the input data of the block processor 303correspond to a block configured of 12 bytes, the symbol-byte converter612 outputs 12 data bytes from X0 to X11, and the symbol-byte converter614 outputs 12 data bytes from Y0 to Y11.

FIG. 21( b) illustrates an example of data being inputted to the trellisencoding module 256. Particularly, FIG. 21( b) illustrates an example ofnot only the mobile service data but also the main service data and RSparity data being inputted to the trellis encoding module 256, so as tobe distributed to each trellis encoder. More specifically, the mobileservice data outputted from the block processor 303 pass through thegroup formatter 304, from which the mobile service data are mixed withthe main service data and RS parity data and then outputted, as shown inFIG. 21( a). Accordingly, each data byte is respectively inputted to the12 trellis encoders in accordance with the positions (or places) withinthe data group after being data-interleaved.

Herein, when the output data bytes X and Y of the symbol-byte converters612 and 614 are assigned to each respective trellis encoder, the inputof each trellis encoder may be configured as shown in FIG. 21( b). Morespecifically, referring to FIG. 21( b), the six mobile service databytes (X0 to X5) outputted from the symbol-byte converter 612 aresequentially assigned (or distributed) to the first to sixth trellisencoders (0 to 5) of the trellis encoding module 256. Also, the 2 mobileservice data bytes Y0 and Y1 outputted from the symbol-byte converter614 are sequentially assigned to the 7^(th) and 8^(th) trellis encoders(6 and 7) of the trellis encoding module 256. Thereafter, among the 5main service data bytes, 4 data bytes are sequentially assigned to the9^(th) and 12^(th) trellis encoders (8 to 11) of the trellis encodingmodule 256. Finally, the remaining 1 byte of the main service data byteis assigned once again to the first trellis encoder (0).

It is assumed that the mobile service data, the main service data, andthe RS parity data are assigned to each trellis encoder, as shown inFIG. 21( b). It is also assumed that, as described above, the input ofthe block processor 303 is configured of 12 bytes, and that 12 bytesfrom X0 to X11 are outputted from the symbol-byte converter 612, andthat 12 bytes from Y0 to Y11 are outputted from the symbol-byteconverter 614. In this case, as shown in FIG. 21( c), the blockformatter 620 arranges the data bytes that are to be outputted from thesymbol-byte converters 612 and 614 by the order of X0 to X5, Y0, Y1, X6to X10, Y2 to Y7, X11, and Y8 to Y11. More specifically, the trellisencoder that is to perform the encoding process is decided based uponthe position (or place) within the transmission frame in which each databyte is inserted. At this point, not only the mobile service data butalso the main service data, the MPEG header data, and the RS parity dataare also inputted to the trellis encoding module 256. Herein, it isassumed that, in order to perform the above-described operation, theblock formatter 620 is informed of (or knows) the information on thedata group format after the data-interleaving process.

FIG. 24 illustrates a block diagram of the block processor performing anencoding process at a coding rate of 1/N according to an embodiment ofthe present invention. Herein, the block processor includes (N−1) numberof symbol interleavers 741 to 74N−1, which are configured in a parallelstructure. More specifically, the block processor having the coding rateof 1/N consists of a total of N number of branches (or paths) includinga branch (or path), which is directly transmitted to the block formatter730. In addition, the symbol interleaver 741 to 74N−1 of each branch mayeach be configured of a different symbol interleaver. Furthermore, (N−1)number of symbol-byte converter 751 to 75N−1 each corresponding to each(N−1) number of symbol interleavers 741 to 74N−1 may be included at theend of each symbol interleaver, respectively. Herein, the output data ofthe (N−1) number of symbol-byte converter 751 to 75N−1 are also inputtedto the block formatter 730.

In the example of the present invention, N is equal to or smaller than12. If N is equal to 12, the block formatter 730 may align the outputdata so that the output byte of the 12^(th) symbol-byte converter 75N−1is inputted to the 12^(th) trellis encoder. Alternatively, if N is equalto 3, the block formatter 730 may arrange the output order, so that thedata bytes outputted from the symbol-byte converter 720 are inputted tothe 1^(st) to 4^(th) trellis encoders of the trellis encoding module256, and that the data bytes outputted from the symbol-byte converter751 are inputted to the 5^(th) to 8^(th) trellis encoders, and that thedata bytes outputted from the symbol-byte converter 752 are inputted tothe 9^(th) to 12^(th) trellis encoders. At this point, the order of thedata bytes outputted from each symbol-byte converter may vary inaccordance with the position within the data group of the data otherthan the mobile service data, which are mixed with the mobile servicedata that are outputted from each symbol-byte converter.

FIG. 25 illustrates a detailed block diagram showing the structure of ablock processor according to another embodiment of the presentinvention. Herein, the block formatter is removed from the blockprocessor so that the operation of the block formatter may be performedby a group formatter. More specifically, the block processor of FIG. 25may include a byte-symbol converter 810, symbol-byte converters 820 and840, and a symbol interleaver 830. In this case, the output of eachsymbol-byte converter 820 and 840 is inputted to the group formatter850.

Also, the block processor may obtain a desired coding rate by addingsymbol interleavers and symbol-byte converters. If the system designerwishes a coding rate of 1/N, the block processor needs to be providedwith a total of N number of branches (or paths) including a branch (orpath) directly transmitted to the block formatter 850, and (N−1) numberof symbol interleavers and symbol-byte converters configured in aparallel structure with (N−1) number of branches. At this point, thegroup formatter 850 inserts place holders ensuring the positions (orplaces) for the MPEG header, the non-systematic RS parity, and the mainservice data. And, at the same time, the group formatter 850 positionsthe data bytes outputted from each branch of the block processor.

The number of trellis encoders, the number of symbol-byte converters,and the number of symbol interleavers proposed in the present inventionare merely exemplary. And, therefore, the corresponding numbers do notlimit the spirit or scope of the present invention. It is apparent tothose skilled in the art that the type and position of each data bytebeing allocated to each trellis encoder of the trellis encoding module256 may vary in accordance with the data group format. Therefore, thepresent invention should not be understood merely by the examples givenin the description set forth herein. The mobile service data that areencoded at a coding rate of 1/N and outputted from the block processor303 are inputted to the group formatter 304. Herein, in the example ofthe present invention, the order of the output data outputted from theblock formatter of the block processor 303 are aligned and outputted inaccordance with the position of the data bytes within the data group.

Signaling Information Processing

The transmitter 200 according to the present invention may inserttransmission parameters by using a plurality of methods and in aplurality of positions (or places), which are then transmitted to thereceiving system. For simplicity, the definition of a transmissionparameter that is to be transmitted from the transmitter to thereceiving system will now be described. The transmission parameterincludes data group information, region information within a data group,the number of RS frames configuring a super frame (i.e., a super framesize (SFS)), the number of RS parity data bytes (P) for each columnwithin the RS frame, whether or not a checksum, which is added todetermine the presence of an error in a row direction within the RSframe, has been used, the type and size of the checksum if the checksumis used (presently, 2 bytes are added to the CRC), the number of datagroups configuring one RS frame—since the RS frame is transmitted to oneburst section, the number of data groups configuring the one RS frame isidentical to the number of data groups within one burst (i.e., burstsize (BS)), a turbo code mode, and a RS code mode.

Also, the transmission parameter required for receiving a burst includesa burst period—herein, one burst period corresponds to a value obtainedby counting the number of fields starting from the beginning of acurrent burst until the beginning of a next burst, a positioning orderof the RS frames that are currently being transmitted within a superframe (i.e., a permuted frame index (PFI)) or a positioning order ofgroups that are currently being transmitted within a RS frame (burst)(i.e., a group index (GI)), and a burst size. Depending upon the methodof managing a burst, the transmission parameter also includes the numberof fields remaining until the beginning of the next burst (i.e., time tonext burst (TNB)). And, by transmitting such information as thetransmission parameter, each data group being transmitted to thereceiving system may indicate a relative distance (or number of fields)between a current position and the beginning of a next burst.

The information included in the transmission parameter corresponds toexamples given to facilitate the understanding of the present invention.Therefore, the proposed examples do not limit the scope or spirit of thepresent invention and may be easily varied or modified by anyone skilledin the art. According to the first embodiment of the present invention,the transmission parameter may be inserted by allocating a predeterminedregion of the mobile service data packet or the data group. In thiscase, the receiving system performs synchronization and equalization ona received signal, which is then decoded by symbol units. Thereafter,the packet deformatter may separate the mobile service data and thetransmission parameter so as to detect the transmission parameter.According to the first embodiment, the transmission parameter may beinserted from the group formatter 304 and then transmitted.

According to the second embodiment of the present invention, thetransmission parameter may be multiplexed with another type of data. Forexample, when known data are multiplexed with the mobile service data, atransmission parameter may be inserted, instead of the known data, in aplace (or position) where a known data byte is to be inserted.Alternatively, the transmission parameter may be mixed with the knowndata and then inserted in the place where the known data byte is to beinserted. According to the second embodiment, the transmission parametermay be inserted from the group formatter 304 or from the packetformatter 306 and then transmitted. For example, a service identifierrespective of a broadcast program, the RS mode of regions A and B withina data group, the RS mode of region C, a super frame size (SFS),position information occupied by an RS frame within the super frame(i.e., permuted frame index (PFI)), a burst size (BS), a data groupindex (GI), and a time to next burst (TNB) may be inserted in the firstknown data region to the fourth known data pattern region and thentransmitted, as shown in FIG. 8.

According to a third embodiment of the present invention, thetransmission parameter may be inserted by allocating a portion of areserved region within a field synchronization segment of a transmissionframe. In this case, since the receiving system may perform decoding ona receiving signal by symbol units before detecting the transmissionparameter, the transmission parameter having information on theprocessing methods of the block processor 303 and the group formatter304 may be inserted in a reserved field of a field synchronizationsignal. More specifically, the receiving system obtains fieldsynchronization by using a field synchronization segment so as to detectthe transmission parameter from a pre-decided position. According to thethird embodiment, the transmission parameter may be inserted from thesynchronization multiplexer 240 and then transmitted.

According to the fourth embodiment of the present invention, thetransmission parameter may be inserted in a layer (or hierarchicalregion) higher than a transport stream (TS) packet. In this case, thereceiving system should be able to receive a signal and process thereceived signal to a layer higher than the TS packet in advance. At thispoint, the transmission parameter may be used to certify thetransmission parameter of a currently received signal and to provide thetransmission parameter of a signal that is to be received in a laterprocess.

In the present invention, the variety of transmission parametersassociated with the transmission signal may be inserted and transmittedby using the above-described methods according to the first to fourthembodiment of the present invention. At this point, the transmissionparameter may be inserted and transmitted by using only one of the fourembodiments described above, or by using a selection of theabove-described embodiments, or by using all of the above-describedembodiments. Furthermore, the information included in the transmissionparameter may be duplicated and inserted in each embodiment.Alternatively, only the required information may be inserted in thecorresponding position of the corresponding embodiment and thentransmitted. Furthermore, in order to ensure robustness of thetransmission parameter, a block encoding process of a short cycle (orperiod) may be performed on the transmission parameter and, then,inserted in a corresponding region. The method for performing ashort-period block encoding process on the transmission parameter mayinclude, for example, Kerdock encoding, BCH encoding, RS encoding, andrepetition encoding of the transmission parameter. Also, a combinationof a plurality of block encoding methods may also be performed on thetransmission parameter.

The transmission parameters may be grouped to create a block code of asmall size, so as to be inserted in a byte place allocated within thedata group for signaling and then transmitted. However, in this case,the block code passes through the block decoded from the receiving endso as to obtain a transmission parameter value. Therefore, thetransmission parameters of the turbo code mode and the RS code mode,which are required for block decoding, should first be obtained.Accordingly, the transmission parameters associated with a particularmode may be inserted in a specific section of a known data region. And,in this case, a correlation of with a symbol may be used for a fasterdecoding process. The receiving system refers to the correlation betweeneach sequence and the currently received sequences, thereby determiningthe encoding mode and the combination mode.

Meanwhile, when the transmission parameter is inserted in the fieldsynchronization segment region or the known data region and thentransmitted, and when the transmission parameter has passed through thetransmission channel, the reliability of the transmission parameter isdeteriorated. Therefore, one of a plurality of pre-defined patterns mayalso be inserted in accordance with the corresponding transmissionparameter. Herein, the receiving system performs a correlationcalculation between the received signal and the pre-defined patterns soas to recognize the transmission parameter. For example, it is assumedthat a burst including 5 data groups is pre-decided as pattern F basedupon an agreement between the transmitting system and the receivingsystem. In this case, the transmitting system inserts and transmitspattern F, when the number of groups within the burst is equal to 5.Thereafter, the receiving system calculates a correlation between thereceived data and a plurality of reference patterns including pattern F,which was created in advance. At this point, if the correlation valuebetween the received data and pattern F is the greatest, the receiveddata indicates the corresponding parameter, and most particularly, thenumber of groups within the burst. At this point, the number of groupsmay be acknowledged as 5. Hereinafter, the process of inserting andtransmitting the transmission parameter will now be described accordingto first, second, and third embodiments of the present invention.

FIRST EMBODIMENT

FIG. 26 illustrates a schematic diagram of the group formatter 304receiving the transmission parameter and inserting the receivedtransmission parameter in region A of the data group according to thepresent invention. Herein, the group formatter 304 receives mobileservice data from the block processor 303. Conversely, the transmissionparameter is processed with at least one of a data randomizing process,a RS frame encoding process, and a block processing process, and maythen be inputted to the group formatter 304. Alternatively, thetransmission parameter may be directly inputted to the group formatter304 without being processed with any of the above-mentioned processes.In addition, the transmission parameter may be provided from the servicemultiplexer 100. Alternatively, the transmission parameter may also begenerated and provided from within the transmitter 200. The transmissionparameter may also include information required by the receiving systemin order to receive and process the data included in the data group. Forexample, the transmission parameter may include data group information,and multiplexing information.

The group formatter 304 inserts the mobile service data and transmissionparameter which are to be inputted to corresponding regions within thedata group in accordance with a rule for configuring a data group. Forexample, the transmission parameter passes through a block encodingprocess of a short period and is, then, inserted in region A of the datagroup. Particularly, the transmission parameter may be inserted in apre-arranged and arbitrary position (or place) within region A. If it isassumed that the transmission parameter has been block-encoded by theblock processor 303, the block processor 303 performs the same dataprocessing operation as the mobile service data, more specifically,either a ½-rate encoding or ¼-rate encoding process on the signalinginformation including the transmission parameter. Thereafter, the blockprocessor 303 outputs the processed transmission parameter to the groupformatter 304. Thereafter, the signaling information is also recognizedas the mobile service data and processed accordingly.

FIG. 27 illustrates a block diagram showing an example of the blockprocessor receiving the transmission parameter and processing thereceived transmission parameter with the same process as the mobileservice data. Particularly, FIG. 27 illustrates an example showing thestructure of FIG. 16 further including a signaling information provider411 and multiplexer 412. More specifically, the signaling informationprovider 411 outputs the signaling information including thetransmission parameter to the multiplexer 412. The multiplexer 412multiplexes the signaling information and the output of the RS frameencoder 302. Then, the multiplexer 412 outputs the multiplexed data tothe byte-bit converter 401.

The byte-bit converter 401 divides the mobile service data bytes orsignaling information byte outputted from the multiplexer 412 into bits,which are then outputted to the symbol encoder 402. The subsequentoperations are identical to those described in FIG. 16. Therefore, adetailed description of the same will be omitted for simplicity. If anyof the detailed structures of the block processor 303 shown in FIG. 20,FIG. 23, FIG. 24, and FIG. 25, the signaling information provider 411and the multiplexer 412 may be provided after the byte-symbol converter.

SECOND EMBODIMENT

Meanwhile, when known data generated from the group formatter inaccordance with a pre-decided rule are inserted in a correspondingregion within the data group, a transmission parameter may be insertedin at least a portion of a region, where known data may be inserted,instead of the known data. For example, when a long known data sequenceis inserted at the beginning of region A within the data group, atransmission parameter may be inserted in at least a portion of thebeginning of region A, such as the first known data region to the fourthknown data pattern region, instead of the known data. A portion of theknown data sequence that is inserted in the remaining portion of regionA, excluding the portion in which the transmission parameter isinserted, may be used to detect a starting point of the data group bythe receiving system, as shown in FIG. 8. Alternatively, another portionof region A may be used for channel equalization by the receivingsystem.

In addition, when the transmission parameter is inserted in the knowndata region instead of the actual known data. The transmission parametermay be block encoded in short periods and then inserted. Also, asdescribed above, the transmission parameter may also be inserted basedupon a pre-defined pattern in accordance with the transmissionparameter. If the group formatter 304 inserts known data place holdersin a region within the data group, wherein known data may be inserted,instead of the actual known data, the transmission parameter may beinserted by the packet formatter 306. More specifically, when the groupformatter 304 inserts the known data place holders, the packet formatter306 may insert the known data instead of the known data place holders.Alternatively, when the group formatter 304 inserts the known data, theknown data may be directly outputted without modification.

FIG. 28 illustrates a block diagram showing the structure of a packetformatter 306 being expanded so that the packet formatter 306 can insertthe transmission parameter according to an embodiment of the presentinvention. More specifically, the structure of the packet formatter 306further includes a known data generator 351 and a signaling multiplexer352. For example, the transmission parameter being inputted to thesignaling multiplexer 352 may include information on a length of thecurrent burst, information indicating the starting point of a nextburst, information on positions and lengths of groups within the burst,information on a time to a next group from the current group within theburst, and information on the known data.

The signaling multiplexer 352 selects one of the transmission parameterand the known data generated from the known data generator 351 and,then, outputs the selected data to the packet formatter 306. The packetformatter 306 inserts the known data or transmission parameter outputtedfrom the signaling multiplexer 352 into the known data place holdersoutputted from the data deinterleaver 305. Then, the packet formatter306 outputs the processed data. More specifically, the packet formatter306 inserts a transmission parameter in at least a portion of the knowndata region instead of the known data, which is then outputted. Forexample, when a known data place holder is inserted at a beginningportion of region A within the data group, a transmission parameter maybe inserted in a portion of the known data place holder instead of theactual known data.

Also, when the transmission parameter is inserted in the known dataplace holder instead of the known data, the transmission parameter maybe block encoded in short periods and inserted. Alternatively, apre-defined pattern may be inserted in accordance with the transmissionparameter. More specifically, the signaling multiplexer 352 multiplexesthe known data and the transmission parameter (or the pattern defined bythe transmission parameter) so as to configure a new known datasequence. Then, the signaling multiplexer 352 outputs the newlyconfigured known data sequence to the packet formatter 306. The packetformatter 306 deletes the main service data place holder and RS parityplace holder from the output of the data deinterleaver 305, and createsa mobile service data packet of 188 bytes by using the mobile servicedata, MPEG header, and the output of the signaling multiplexer. Then,the packet formatter 306 outputs the newly created mobile service datapacket to the packet multiplexer 240.

In this case, the region A of each data group has a different known datapattern. Therefore, the receiving system separates only the symbol in apre-arranged section of the known data sequence and recognizes theseparated symbol as the transmission parameter. Herein, depending uponthe design of the transmitting system, the known data may be inserted indifferent blocks, such as the packet formatter 306, the group formatter304, or the block processor 303. Therefore, a transmission parameter maybe inserted instead of the known data in the block wherein the knowndata are to be inserted.

According to the second embodiment of the present invention, atransmission parameter including information on the processing method ofthe block processor 303 may be inserted in a portion of the known dataregion and then transmitted. In this case, a symbol processing methodand position of the symbol for the actual transmission parameter symbolare already decided. Also, the position of the transmission parametersymbol should be positioned so as to be transmitted or received earlierthan any other data symbols that are to be decoded. Accordingly, thereceiving system may detect the transmission symbol before the datasymbol decoding process, so as to use the detected transmission symbolfor the decoding process.

THIRD EMBODIMENT

Meanwhile, the transmission parameter may also be inserted in the fieldsynchronization segment region and then transmitted. FIG. 29 illustratesa block diagram showing the synchronization multiplexer being expandedin order to allow the transmission parameter to be inserted in the fieldsynchronization segment region. Herein, a signaling multiplexer 261 isfurther included in the synchronization multiplexer 260. Thetransmission parameter of the general VSB method is configured of 2fields. More specifically, each field is configured of one fieldsynchronization segment and 312 data segments. Herein, the first 4symbols of a data segment correspond to the segment synchronizationportion, and the first data segment of each field corresponds to thefield synchronization portion.

One field synchronization signal is configured to have the length of onedata segment. The data segment synchronization pattern exists in thefirst 4 symbols, which are then followed by pseudo random sequences PN511, PN 63, PN 63, and PN 63. The next 24 symbols include informationassociated with the VSB mode. Additionally, the 24 symbols that includeinformation associated with the VSB mode are followed by the remaining104 symbols, which are reserved symbols. Herein, the last 12 symbols ofa previous segment are copied and positioned as the last 12 symbols inthe reserved region. In other words, only the 92 symbols in the fieldsynchronization segment are the symbols that correspond to the actualreserved region.

Therefore, the signaling multiplexer 261 multiplexes the transmissionparameter with an already-existing field synchronization segment symbol,so that the transmission parameter can be inserted in the reservedregion of the field synchronization segment. Then, the signalingmultiplexer 261 outputs the multiplexed transmission parameter to thesynchronization multiplexer 260. The synchronization multiplexer 260multiplexes the segment synchronization symbol, the data symbols, andthe new field synchronization segment outputted from the signalingmultiplexer 261, thereby configuring a new transmission frame. Thetransmission frame including the field synchronization segment, whereinthe transmission parameter is inserted, is outputted to the transmissionunit 270. At this point, the reserved region within the fieldsynchronization segment for inserting the transmission parameter maycorrespond to a portion of or the entire 92 symbols of the reservedregion. Herein, the transmission parameter being inserted in thereserved region may, for example, include information identifying thetransmission parameter as the main service data, the mobile servicedata, or a different type of mobile service data.

If the information on the processing method of the block processor 303is transmitted as a portion of the transmission parameter, and when thereceiving system wishes to perform a decoding process corresponding tothe block processor 303, the receiving system should be informed of suchinformation on the block processing method in order to perform thedecoding process. Therefore, the information on the processing method ofthe block processor 303 should already be known prior to the blockdecoding process. Accordingly, as described in the third embodiment ofthe present invention, when the transmission parameter having theinformation on the processing method of the block processor 303 (and/orthe group formatter 304) is inserted in the reserved region of the fieldsynchronization signal and then transmitted, the receiving system iscapable of detecting the transmission parameter prior to performing theblock decoding process on the received signal.

Receiving System

FIG. 30 illustrates a block diagram showing a structure of a digitalbroadcast receiving system according to the present invention. Thedigital broadcast receiving system of FIG. 30 uses known datainformation, which is inserted in the mobile service data section and,then, transmitted by the transmitting system, so as to perform carriersynchronization recovery, frame synchronization recovery, and channelequalization, thereby enhancing the receiving performance. Referring toFIG. 30, the digital broadcast receiving system includes a demodulator1002, an equalizer 1003, a known data detector 1004, a block decoder1005, a data deformatter 1006, a RS frame decoder 1007, a derandomizer1008, a data deinterleaver 1009, a RS decoder 1010, and a dataderandomizer 1011. Herein, for simplicity of the description of thepresent invention, the data deformatter 1006, the RS frame decoder 1007,and the derandomizer 1008 will be collectively referred to as a mobileservice data processing unit. And, the data deinterleaver 1009, the RSdecoder 1010, and the data derandomizer 1011 will be collectivelyreferred to as a main service data processing unit. For example, if thereceiving system corresponds to a mobile transmission receiving system,the main service data processing unit may be omitted.

More specifically, a frequency of a particular channel is tuned anddown-converted to an intermediate frequency (IF) signal by a tuner.Then, the down-converted IF data 1001 are outputted to the demodulator1002 and the known data detector 1004. At this point, the down-convertedIF data 1001 pass through an analog/digital converter (ADC) (not shown),which converts pass band analog IF signals to digital IF signals, so asto be inputted to the demodulator 1002 and the known data detector 1004.The demodulator 1002 performs self gain control, carrier recovery, andtiming recovery processes on the inputted IF signal, thereby modifyingthe IF signal to a baseband signal. Then, the demodulator 1002 outputsthe digitalized and inputted pass band IF signal to the equalizer 1003and the known data detector 1004. The equalizer 1003 compensates thedistortion of the channel included in the demodulated signal and thenoutputs the error-compensated signal to the block decoder 1005.

At this point, the known data detector 1004 detects the known sequenceplace inserted by the transmitting end from the input/output data of thedemodulator 1002 (i.e., the data prior to the demodulation process orthe data after the demodulation process). Thereafter, the placeinformation (or position indicator) along with the symbol sequence ofthe known data, which are generated from the detected place, isoutputted to the demodulator 1002 and the equalizer 1003. Also, theknown data detector 1004 outputs a set of information to the blockdecoder 1005. This set of information is used to allow the block decoder1005 of the receiving system to identify the mobile service data thatare processed with additional encoding from the transmitting system andthe main service data that are not processed with additional encoding.In addition, although the connection status is not shown in FIG. 30, theinformation detected from the known data detector 1004 may be usedthroughout the entire receiving system and may also be used in the datadeformatter 1006 and the RS frame decoder 1007.

The demodulator 1002 uses the known data (or sequence) positionindicator and the known data symbol sequence during the timing and/orcarrier recovery, thereby enhancing the demodulating performance.Similarly, the equalizer 1003 uses the known sequence position indicatorand the known data symbol sequence so as to enhance the equalizingperformance. Moreover, the decoding result of the block decoder 1005 maybe fed-back to the equalizer 1003, thereby enhancing the equalizingperformance.

Demodulator and Known Sequence Detector within Receiving System

At this point, the transmitting system may periodically insert andtransmit known data within a transmission frame, as shown in FIG. 7A andFIG. 8. FIG. 31 illustrates an example of known data sequence beingperiodically inserted and transmitted in-between actual data by thetransmitting system. Referring to FIG. 31, AS represents the number ofgeneral data symbols, and BS represents the number of known datasymbols. Therefore, BS number of known data symbols are inserted andtransmitted at a period of (AS+BS) symbols. Herein, AS may correspond tomobile service data, main service data, or a combination of mobileservice data and main service data. In order to be differentiated fromthe known data, data corresponding to AS will hereinafter be referred toas general data.

Referring to FIG. 31, known data sequence having the same pattern areincluded in each known data section that is being periodically inserted.Herein, the length of the known data sequence having identical datapatterns may be either equal to or different from the length of theentire (or total) known data sequence of the corresponding known datasection (or block). If the two lengths are different from one another,the length of the entire known data sequence should be longer than thelength of the known data sequence having identical data patterns. Inthis case, the same known data sequences are included in the entireknown data sequence. For example, if a known data pattern F is insertedfor channel equalization, each known data section includes at least onepattern F.

Accordingly, when the known data are regularly inserted in-between thevalid data as described above, the channel equalizer included in thedigital broadcast receiver used the inserted known data as a trainingsequence, so as to be used either for an accurate decision value or forestimating an impulse response of a channel. Meanwhile, when the sameknown data are regularly inserted, the known data interval may be usedas a guard interval in a channel equalizer according to the presentinvention. Herein, the guard interval prevents interference that occursbetween blocks due to a multiple path channel. This is because the knowndata of the known data section located at the end portion of the datablock of the (AS+BS) symbol, shown in FIG. 31, may be considered to becopied and place before the data block.

The above-described structure is referred to as a cyclic prefix. Thisstructure provides circular convolution to an impulse response in a timedomain between a data block transmitted from the digital broadcasttransmitting system and a channel. Accordingly, this facilitates thechannel equalizer of a digital broadcast receiving system to performchannel equalization in a frequency domain by using a fast fouriertransform (FFT) and an inverse fast fourier transform (IFFT). Morespecifically, when viewed in the frequency domain, the data blockreceived by the digital broadcast receiving system is expressed as amultiplication of the data block and the channel impulse response.Therefore, when performing the channel equalization, by multiplying theinverse of the channel in the frequency domain, the channel equalizationmay be performed more easily.

The known data detector 1004 detects the position of the known databeing periodically inserted and transmitted as described above. At thesame time, the known data detector 1004 may also estimate initialfrequency offset during the process of detecting known data. In thiscase, the demodulator 1002 may estimate with more accuracy carrierfrequency offset from the information on the known data position (orknown sequence position indicator) and initial frequency offsetestimation value, thereby compensating the estimated initial frequencyoffset.

FIG. 32 is a flow chart illustrating a method of detecting positions ofknown data according to an embodiment of the present invention, when theknown data are transmitted in the same structure as that shown in FIG.8. The known sequence detector 1004 initially detects the position ofthe first known data region using a plurality of first known datapatterns included in the first known data region (Step 2001). At thispoint, since the known sequence detector 1004 is well-informed of thedata frame structure, when the position of the first known data regionis detected, the known sequence detector 1004 can estimate the positionof the field synchronization segment of a corresponding data group,which is positioned chronologically before the first known data region,by counting symbols or segments based upon the first known data regionposition (Step 2002). Also, the known sequence detector 1004 can furtherestimate positions of the second, third, fourth, and fifth known dataregions, which are positioned chronologically after the first known dataregion, by counting symbols or segments based upon the first known dataregion position (Step 2003).

The estimated position information of the field synchronization segmentand known data regions are provided to the demodulator 1002 and theequalizer 1003. For example, the position information of thesynchronization segment and the second known data pattern region of eachknown data region, wherein the second known data pattern region isassigned with 1424 symbols, may be provided to the equalizer 1003. Inthis case, it is assumed that the equalizer 1003 stores in advance thefield synchronization data, which are to be inserted in the fieldsynchronization region, and the second known data pattern, which isinserted in the second known data pattern region, in order to estimatechannel the impulse response (CIR) during the field synchronizationsection and the known data section, wherein the second known datapattern is to be inserted. Also, during the process of detecting theposition of the first known data region, the known sequence detector1004 may estimate an initial frequency offset from the first known datapattern. In this case, the demodulator 1002 may estimate and compensatethe known data position information and the initial frequency offsetestimation value with more accuracy.

FIG. 33 illustrates a detailed block diagram of a demodulator accordingto the present invention. Referring to FIG. 33, the demodulator includesa phase splitter 1010, a numerically controlled oscillator (NCO) 1020, afirst multiplier 1030, a resampler 1040, a second multiplier 1050, amatched filter 1060, a DC remover 1070, a timing recovery unit 1080, acarrier recovery unit 1090, and a phase compensator 1110. Herein, theknown sequence detector 1004 includes a known sequence detector andinitial frequency offset estimator 1004-1 for estimating known datainformation and initial frequency offset. Also referring to FIG. 33, thephase splitter 1010 receives a pass band digital signal and splits thereceived signal into a pass band digital signal of a real number elementand a pass band digital signal of an imaginary number element bothhaving a phase of 90 degrees between one another. In other words, thepass band digital signal is split into complex signals. The splitportions of the pass band digital signal are then outputted to the firstmultiplier 1030. Herein, the real number signal outputted from the phasesplitter 1010 will be referred to as an ‘I’ signal, and the imaginarynumber signal outputted from the phase splitter 1010 will be referred toas a ‘Q’ signal, for simplicity of the description of the presentinvention.

The first multiplier 1030 multiplies the I and Q pass band digitalsignals, which are outputted from the phase splitter 1010, to a complexsignal having a frequency proportional to a constant being outputtedfrom the NCO 1020, thereby changing the I and Q pass band digitalsignals to baseband digital complex signals. Then, the baseband digitalsignals of the first multiplier 1030 are inputted to the resampler 1040.The resampler 1040 resamples the signals being outputted from the firstmultiplier 1030 so that the signal corresponds to the timing clockprovided by the timing recovery unit 1080. Thereafter, the resampler1040 outputs the resampled signals to the second multiplier 1050.

For example, when the analog/digital converter uses a 25 MHz fixedoscillator, the baseband digital signal having a frequency of 25 MHz,which is created by passing through the analog/digital converter, thephase splitter 1010, and the first multiplier 1030, is processed with aninterpolation process by the resampler 1040. Thus, the interpolatedsignal is recovered to a baseband digital signal having a frequencytwice that of the receiving signal of a symbol clock (i.e., a frequencyof 21.524476 MHz). Alternatively, if the analog/digital converter usesthe timing clock of the timing recovery unit 1080 as the samplingfrequency (i.e., if the analog/digital converter uses a variablefrequency) in order to perform an A/D conversion process, the resampler1040 is not required and may be omitted.

The second multiplier 1050 multiplies an output frequency of the carrierrecovery unit 1090 with the output of the resampler 1040 so as tocompensate any remaining carrier included in the output signal of theresampler 1040. Thereafter, the compensated carrier is outputted to thematched filter 1060 and the timing recovery unit 1080. The signalmatched-filtered by the matched filter 1060 is inputted to the DCremover 1070, the known sequence detector and initial frequency offsetestimator 1004-1, and the carrier recovery unit 1090.

The known sequence detector and initial frequency offset estimator1004-1 detects the place (or position) of the known data sequences thatare being periodically or non-periodically transmitted. Simultaneously,the known sequence detector and initial frequency offset estimator1004-1 estimates an initial frequency offset during the known sequencedetection process. Additionally, the known sequence detector and initialfrequency offset estimator 1004-1 may also extract and output a groupvalid indicator, which is a group valid information, and a burst validindication, which is a burst valid information. More specifically, whilethe transmission data frame is being received, as shown in FIG. 7A andFIG. 8, the known sequence detector and initial frequency offsetestimator 1004-1 detects the position (or place) of the known dataincluded in the transmission data frame. Then, the known sequencedetector and initial frequency offset estimator 1004-1 outputs thedetected information on the known data place (i.e., a known sequenceposition indicator) to the timing recovery unit 1080, the carrierrecovery unit 1090, and the phase compensator 1110 of the demodulator1002 and the equalizer 1003. Furthermore, the known sequence detectorand initial frequency offset estimator 1004-1 estimates the initialfrequency offset, which is then outputted to the carrier recovery unit1090. At this point, the known sequence detector and initial frequencyoffset estimator 1004-1 may either receive the output of the matchedfilter 1060 or receive the output of the resampler 1040. This may beoptionally decided depending upon the design of the system designer.

The timing recovery unit 1080 uses the output of the second multiplier1050 and the known sequence position indicator detected from the knownsequence detector and initial frequency offset estimator 1004-1, so asto detect the timing error and, then, to output a sampling clock beingin proportion with the detected timing error to the resampler 1040,thereby adjusting the sampling timing of the resampler 1040. At thispoint, the timing recovery unit 1080 may receive the output of thematched filter 1060 instead of the output of the second multiplier 1050.This may also be optionally decided depending upon the design of thesystem designer.

Meanwhile, the DC remover 1070 removes a pilot tone signal (i.e., DCsignal), which has been inserted by the transmitting system, from thematched-filtered signal. Thereafter, the DC remover 1070 outputs theprocessed signal to the phase compensator 1110. The phase compensator1110 uses the data having the DC removed by the DC remover 1070 and theknown sequence position indicator detected by the known sequencedetector and initial frequency offset estimator 1004-1 to estimate thefrequency offset and, then, to compensate the phase change included inthe output of the DC remover 1070. The data having its phase changecompensated are inputted to the equalizer 1003. Herein, the phasecompensator 1110 is optional. If the phase compensator 1110 is notprovided, then the output of the DC remover 1070 is inputted to theequalizer 1003 instead.

FIG. 34 includes detailed block diagrams of the timing recovery unit1080, the carrier recovery unit 1090, and the phase compensator 1110 ofthe demodulator. According to an embodiment of the present invention,the timing recovery unit 1080 includes a decimator 1081, a buffer 1082,a timing error detector 1083, a loop filter 1084, a holder 1085, and aNCO 1086. The carrier recovery unit 1090 includes a buffer 1091, afrequency offset estimator 1092, a loop filter 1093, a holder 1094, anadder 1095, and a NCO 1096. Herein, a decimator may be included beforethe buffer 1091. Finally, the phase compensator 1110 includes a buffer1111, a frequency offset estimator 1112, a holder 1113, a NCO 1114, anda multiplier 1115. Furthermore, a decimator 1200 may be included betweenthe phase compensator 1110 and the equalizer 1003. The decimator 1200may be outputted in front of the DC remover 1070 instead of at theoutputting end of the phase compensator 1110.

Herein, the decimators correspond to components required when a signalbeing inputted to the demodulator is oversampled to N times by theanalog/digital converter. More specifically, the integer N representsthe sampling rate of the received signal. For example, when the inputsignal is oversampled to 2 times (i.e., when N=2) by the analog/digitalconverter, this indicates that two samples are included in one symbol.In this case, each of the decimators corresponds to a ½ decimator.Depending upon whether or not the oversampling process of the receivedsignal has been performed, the signal may bypass the decimators.

Meanwhile, the buffer 1091 of the carrier recovery unit 1090 may receiveeither the data inputted to the matched filter 1060 or the dataoutputted from the matched filter 1060 and, then, temporarily store thereceived data. Thereafter, the temporarily stored data are outputted tothe frequency offset estimator 1092. If a decimator is provided in frontof the buffer 1091, the input data or output data of the matched filter1060 are decimated by the decimator at a decimation rate of 1/N.Thereafter, the decimated data are outputted to the buffer 1091. Forexample, when the input data or output data of the matched filter 1060are oversampled to 2 times (i.e., when N=2), this indicates that theinput data or output data of the matched filter 1060 are decimated at arate of ½ by the decimator 1081 and then outputted to the buffer 1091.More specifically, when a decimator is provided in front of the buffer1091, the carrier recovery unit 1090 operates in symbol units.Alternatively, if a decimator is not provided, the carrier recovery unit1090 operates in oversampling units.

The frequency offset estimator 1092 uses the input data or output dataof the matched filter 1060 and the known sequence position indicatoroutputted from the known sequence detector and initial frequency offsetestimator 1004-1 in order to estimate the frequency offset. Then, theestimated frequency offset is outputted to the loop filter 1093. Morespecifically, the frequency offset estimator 1092 estimates thefrequency offset from the known data sequence prior to or after beingprocessed with matched filtering. Then, the frequency offset estimator1092 outputs the estimated frequency offset to the loop filter 1093.Therefore, the estimated frequency offset value is obtained once everyrepetition period of the known data sequence. The loop filter 1093performs low pass filtering on the frequency offset value estimated bythe frequency offset estimator 1092 and outputs the low pass-filteredfrequency offset value to the holder 1094. The holder 1094 holds (ormaintains) the low pass-filtered frequency offset value during apre-determined known data sequence cycle period and outputs thefrequency offset value to the adder 1095. Herein, the positions of theloop filter 1093 and the holder 1094 may be switched from one to theother. Furthermore, the function of the holder 1085 may be included inthe loop filter 1093, and, accordingly, the holder 1094 may be omitted.

The adder 1095 adds the value of the initial frequency offset estimatedby the known sequence detector and initial frequency offset estimator1004-1 to the frequency offset value outputted from the loop filter 1093(or the holder 1094). Thereafter, the added offset value is outputted tothe NCO 1096. Herein, if the adder 1095 is designed to also receive theconstant being inputted to the NCO 1020, the NCO 1020 and the firstmultiplier 1030 may be omitted. In this case, the second multiplier 1050may simultaneously perform changing signals to baseband signals andremoving remaining carrier.

The NCO 1096 generates a complex signal corresponding to the frequencyoffset outputted from the adder 1095, which is then outputted to thesecond multiplier 1050. Herein, the NCO 1096 may include a ROM. In thiscase, the NCO 1096 generates a compensation frequency corresponding tothe frequency offset being outputted from the adder 1095. Then, the NCO1096 reads a complex cosine corresponding to the compensation frequencyfrom the ROM, which is then outputted to the second multiplier 1050. Thesecond multiplier 1050 multiplies the output of the NCO 1094 included inthe carrier recovery unit 1090 to the output of the resampler 1040, soas to remove the carrier offset included in the output signal of theresampler 1040.

FIG. 35 illustrates a detailed block diagram of the frequency offsetestimator 1092 of the carrier recovery unit 1090 according to anembodiment of the present invention. Herein, the frequency offsetestimator 1092 operates in accordance with the known sequence positionindicator detected from the known sequence detector and initialfrequency offset estimator 1004-1. At this point, if the input data oroutput data of the matched filter 1060 are inputted through thedecimator, the frequency offset estimator 1092 operates in symbol units.Alternatively, if a decimator is not provided, the frequency offsetestimator 1092 operates in oversampling units. In the example given inthe description of the present invention, the frequency offset estimator1092 operates in symbol units. Referring to FIG. 35, the frequencyoffset estimator 1092 includes a controller 1310, a first N symbolbuffer 1301, a K symbol delay 1302, a second N symbol buffer 1303, aconjugator 1304, a multiplier 1305, an accumulator 1306, a phasedetector 1307, a multiplier 1308, and a multiplexer 1309. The frequencyoffset estimator 1092 having the above-described structure, as shown inFIG. 35, will now be described in detail with respect to an operationexample during a known data section.

The first N symbol buffer 1301 may store a maximum of N number of symbolbeing inputted thereto. The symbol data that are temporarily stored inthe first N symbol buffer 1301 are then inputted to the multiplier 1305.At the same time, the inputted symbol is inputted to the K symbol delay1302 so as to be delayed by K symbols. Thereafter, the delayed symbolpasses through the second N symbol buffer 1303 so as to be conjugated bythe conjugator 1304. Thereafter, the conjugated symbol is inputted tothe multiplier 1305. The multiplier 1305 multiplies the output of thefirst N symbol buffer 1301 and the output of the conjugator 1304. Then,the multiplier 1305 outputs the multiplied result to the accumulator1306. Subsequently, the accumulator 1306 accumulates the output of themultiplier 1305 during N symbol periods, thereby outputting theaccumulated result to the phase detector 1307.

The phase detector 1307 extracts the corresponding phase informationfrom the output of the accumulator 1306, which is then outputted to themultiplier 1308. The multiplier 1308 then divides the phase informationby K, thereby outputting the divided result to the multiplexer 1309.Herein, the result of the phase information divided by becomes thefrequency offset estimation value. More specifically, at the point wherethe input of the known data ends or at a desired point, the frequencyoffset estimator 1092 accumulates during an N symbol periodmultiplication of the complex conjugate of N number of the input datastored in the first N symbol buffer 1301 and the complex conjugate ofthe N number of the input data that are delayed by K symbols and storedin the second N symbol buffer 1303. Thereafter, the accumulated value isdivided by K, thereby extracting the frequency offset estimation value.

Based upon a control signal of the controller 1310, the multiplexer 1309selects either the output of the multiplier 1308 or ‘0’ and, then,outputs the selected result as the final frequency offset estimationvalue. The controller 1300 receives the known data sequence positionindicator from the known sequence detector and initial frequency offsetestimator 1004-1 in order to control the output of the multiplexer 1309.More specifically, the controller 1300 determines based upon the knowndata sequence position indicator whether the frequency offset estimationvalue being outputted from the multiplier 1308 is valid. If thecontroller 1300 determines that the frequency offset estimation value isvalid, the multiplexer 1309 selects the output of the multiplier 1308.Alternatively, if the controller 1300 determines that the frequencyoffset estimation value is invalid, the controller 1300 generates acontrol signal so that the multiplexer 1309 can select ‘0’. At thispoint, it is preferable that the input signals stored in the first Nsymbol buffer 1301 and in the second N symbol buffer 1303 correspond tosignals each being transmitted by the same known data and passingthrough almost the same channel. Otherwise, due to the influence of thetransmission channel, the frequency offset estimating performance may belargely deteriorated.

Further, the values N and K of the frequency offset estimator 1092(shown in FIG. 35) may be diversely decided. This is because aparticular portion of the known data that are identically repeated maybe used herein. For example, when the data having the structuredescribed in FIG. 31 are being transmitted, N may be set as BS (i.e.,N=BS), and K may be set as (AS+BS) (i.e., K=AS+BS)). The frequencyoffset estimation value range of the frequency offset estimator 1092 isdecided in accordance with the value K. If the value K is large, thenthe frequency offset estimation value range becomes smaller.Alternatively, if the value K is small, then the frequency offsetestimation value range becomes larger. Therefore, when the data havingthe structure of FIG. 31 is transmitted, and if the repetition cycle(AS+BS) of the known data is long, then the frequency offset estimationvalue range becomes smaller.

In this case, even if the initial frequency offset is estimated by theknown sequence detector and initial frequency offset estimator 1004-1,and if the estimated value is compensated by the second multiplier 1050,the remaining frequency offset after being compensated will exceed theestimation range of the frequency offset estimator 1092. In order toovercome such problems, the known data sequence that is regularlytransmitted may be configured of a repetition of a same data portion byusing a cyclic extension process. For example, if the known datasequence shown in FIG. 31 is configured of two identical portions havingthe length of BS/2, then the N and K values of the frequency offsetestimator 1092 (shown in FIG. 35) may be respectively set as B/2 and B/2(i.e., N=BS/2 and K=BS/2). In this case, the estimation value range maybecome larger than when using repeated known data.

Meanwhile, the known sequence detector and initial frequency offsetestimator 1004-1 detects the place (o position) of the known datasequences that are being periodically or non-periodically transmitted.Simultaneously, the known sequence detector and initial frequency offsetestimator 1004-1 estimates an initial frequency offset during the knownsequence detection process. The known data sequence position indicatordetected by the known sequence detector and initial frequency offsetestimator 1004-1 is outputted to the timing recovery unit 1080, thecarrier recovery unit 1090, and the phase compensator 1110 of thedemodulator 1002, and to the equalizer 1003. Thereafter, the estimatedinitial frequency offset is outputted to the carrier recovery unit 1090.At this point, the known sequence detector and initial frequency offsetestimator 1004-1 may either receive the output of the matched filter1060 or receive the output of the resampler 1040. This may be optionallydecided depending upon the design of the system designer. Herein, thefrequency offset estimator shown in FIG. 35 may be directly applied inthe known sequence detector and initial frequency offset estimator1004-1 or in the phase compensator 1110 of the frequency offsetestimator.

FIG. 36 illustrates a detailed block diagram showing a known sequencedetector and initial frequency offset estimator according to anembodiment of the present invention. More specifically, FIG. 36illustrates an example of an initial frequency offset being estimatedalong with the known sequence position indicator. Herein, FIG. 36 showsan example of an inputted signal being oversampled to N times of itsinitial state. In other words, N represents the sampling rate of areceived signal. Referring to FIG. 36, the known sequence detector andinitial frequency offset estimator includes N number of partialcorrelators 1411 to 141N configured in parallel, a known data placedetector and frequency offset decider 1420, a known data extractor 1430,a buffer 1440, a multiplier 1450, a NCO 1460, a frequency offsetestimator 1470, and an adder 1480. Herein, the first partial correlator1411 consists of a 1/N decimator, and a partial correlator. The secondpartial correlator 1412 consists of a 1 sample delay, a 1/N decimator,and a partial correlator. And, the N^(th) partial correlator 141Nconsists of a N−1 sample delay, a 1/N decimator, and a partialcorrelator. These are used to match (or identify) the phase of each ofthe samples within the oversampled symbol with the phase of the original(or initial) symbol, and to decimate the samples of the remainingphases, thereby performing partial correlation on each sample. Morespecifically, the input signal is decimated at a rate of 1/N for eachsampling phase, so as to pass through each partial correlator.

For example, when the input signal is oversampled to 2 times (i.e., whenN=2), this indicates that two samples are included in one signal. Inthis case, two partial correlators (e.g., 1411 and 1412) are required,and each 1/N decimator becomes a ½ decimator. At this point, the 1/Ndecimator of the first partial correlator 1411 decimates (or removes),among the input samples, the samples located in-between symbol places(or positions). Then, the corresponding 1/N decimator outputs thedecimated sample to the partial correlator. Furthermore, the 1 sampledelay of the second partial correlator 1412 delays the input sample by 1sample (i.e., performs a 1 sample delay on the input sample) and outputsthe delayed input sample to the 1/N decimator. Subsequently, among thesamples inputted from the 1 sample delay, the 1/N decimator of thesecond partial correlator 1412 decimates (or removes) the sampleslocated in-between symbol places (or positions). Thereafter, thecorresponding 1/N decimator outputs the decimated sample to the partialcorrelator.

After each predetermined period of the VSB symbol, each of the partialcorrelators outputs a correlation value and an estimation value of thecoarse frequency offset estimated at that particular moment to the knowndata place detector and frequency offset decider 1420. The known dataplace detector and frequency offset decider 1420 stores the output ofthe partial correlators corresponding to each sampling phase during adata group cycle or a pre-decided cycle. Thereafter, the known dataplace detector and frequency offset decider 1420 decides a position (orplace) corresponding to the highest correlation value, among the storedvalues, as the place (or position) for receiving the known data.Simultaneously, the known data place detector and frequency offsetdecider 1420 finally decides the estimation value of the frequencyoffset estimated at the moment corresponding to the highest correlationvalue as the coarse frequency offset value of the receiving system.

The known sequence position indicator corresponds to the positioninformation (or indicator) of the first known data region, wherein thefirst known data pattern is inserted. The position of a fieldsynchronization segment position and the positions of the second tofifth known data regions may be estimated from the known sequenceposition indicator. Additionally, the position of the second known datapattern region having 1424 symbols assigned thereto, which is includedin each known data region, may also be estimated. At this point, theknown sequence position indicator is inputted to the known dataextractor 1430, the timing recovery unit 1080, the carrier recovery unit1090, the phase compensator 1110, and the equalizer 1003, and the coarsefrequency offset is inputted to the adder 1480 and the NCO 1460.

In the meantime, while the N numbers of partial correlators 1411 to 141Ndetect the known data place (or known sequence position) and estimatethe coarse frequency offset, the buffer 1440 temporarily stores thereceived data and outputs the temporarily stored data to the known dataextractor 1430. The known data extractor 1430 uses the known sequenceposition indicator, which is outputted from the known data placedetector and frequency offset decider 1420, so as to extract the knowndata from the output of the buffer 1440. Thereafter, the known dataextractor 1430 outputs the extracted data to the multiplier 1450. TheNCO 1460 generates a complex signal corresponding to the coarsefrequency offset being outputted from the known data place detector andfrequency offset decider 1420. Then, the NCO 1460 outputs the generatedcomplex signal to the multiplier 1450.

The multiplier 1450 multiplies the complex signal of the NCO 1460 to theknown data being outputted from the known data extractor 1430, therebyoutputting the known data having the coarse frequency offset compensatedto the frequency offset estimator 1470. The frequency offset estimator1470 estimates a fine frequency offset from the known data having thecoarse frequency offset compensated. Subsequently, the frequency offsetestimator 1470 outputs the estimated fine frequency offset to the adder1480. The adder 1480 adds the coarse frequency offset to the finefrequency offset. Thereafter, the adder 1480 decides the added result asa final initial frequency offset, which is then outputted to the adder1095 of the carrier recovery unit 1090 included in the demodulator 1002.More specifically, during the process of acquiring initialsynchronization, the present invention may estimate and use the coarsefrequency offset as well as the fine frequency offset, thereby enhancingthe estimation performance of the initial frequency offset.

It is assumed that the known data is inserted within the data group andthen transmitted, as shown in FIG. 8. Then, the known sequence detectorand initial frequency offset estimator 1004-1 may use a correlationbetween the plurality of first known data patterns within the firstknown data region, so as to estimate the initial frequency offset. Thefield synchronization position indicator, which is estimated by theknown sequence detector and initial frequency offset estimator 1004-1,and the known sequence position indicator, which is periodicallyinserted within region A, (e.g., the position indicator of the secondknown data pattern region that is periodically inserted in each knowndata region) are inputted to the timing error detector 1083 of thetiming error recovery unit 1080, to the frequency offset estimator 1092of the carrier recovery unit 1090, to the frequency offset estimator1112 of the phase compensator 1110, and to the equalizer 1003.

FIG. 37 illustrates a block diagram showing the structure of one of thepartial correlators shown in FIG. 36. During the step of detecting knowndata, since a frequency offset is included in the received signal, eachpartial correlator divides the known data, which is known according toan agreement between the transmitting system and the receiving system,to K number of parts each having an L symbol length, thereby correlatingeach divided part with the corresponding part of the received signal. Inorder to do so, each partial correlator includes K number of phase andsize detector 1511 to 151K each formed in parallel, an adder 1520, and acoarse frequency offset estimator 1530.

The first phase and size detector 1511 includes an L symbol buffer1511-2, a multiplier 1511-3, an accumulator 1511-4, and a squarer1511-5. Herein, the first phase and size detector 1511 calculates thecorrelation value of the known data having a first L symbol length amongthe K number of sections. Also, the second phase and size detector 1512includes an L symbol delay 1512-1, an L symbol buffer 1512-2, amultiplier 1512-3, an accumulator 1512-4, and a squarer 1512-5. Herein,the second phase and size detector 1512 calculates the correlation valueof the known data having a second L symbol length among the K number ofsections. Finally, the N^(th) phase and size detector 151K includes a(K−1)L symbol delay 151K−1, an L symbol buffer 151K−2, a multiplier151K−3, an accumulator 151K−4, and a squarer 151K−5. Herein, the N^(th)phase and size detector 151K calculates the correlation value of theknown data having an N^(th) L symbol length among the K number ofsections.

Referring to FIG. 37, {P0, P1, . . . , PKL−1} each being multiplied withthe received signal in the multiplier represents the known data known byboth the transmitting system and the receiving system (i.e., thereference known data generated from the receiving system). And, *represents a complex conjugate. For example, in the first phase and sizedetector 1511, the signal outputted from the 1/N decimator of the firstpartial correlator 1411, shown in FIG. 36, is temporarily stored in theL symbol buffer 1511-2 of the first phase and size detector 1511 andthen inputted to the multiplier 1511-3. The multiplier 1511-3 multipliesthe output of the L symbol buffer 1511-2 with the complex conjugate ofthe known data parts P0, P1, . . . , PL−1, each having a first L symbollength among the known K number of sections. Then, the multiplied resultis outputted to the accumulator 1511-4. During the L symbol period, theaccumulator 1511-4 accumulates the output of the multiplier 1511-3 and,then, outputs the accumulated value to the squarer 1511-5 and the coarsefrequency offset estimator 1530. The output of the accumulator 1511-4 isa correlation value having a phase and a size. Accordingly, the squarer1511-5 calculates an absolute value of the output of the multiplier1511-4 and squares the calculated absolute value, thereby obtaining thesize of the correlation value. The obtained size is then inputted to theadder 1520.

The adder 1520 adds the output of the squarers corresponding to eachsize and phase detector 1511 to 151K. Then, the adder 1520 outputs theadded result to the known data place detector and frequency offsetdecider 1420. Also, the coarse frequency offset estimator 1530 receivesthe output of the accumulator corresponding to each size and phasedetector 1511 to 151K, so as to estimate the coarse frequency offset ateach corresponding sampling phase. Thereafter, the coarse frequencyoffset estimator 1530 outputs the estimated offset value to the knowndata place detector and frequency offset decider 1420.

When the K number of inputs that are outputted from the accumulator ofeach phase and size detector 1511 to 151K are each referred to as {Z₀,Z₁, . . . , Z_(K−1)}, the output of the coarse frequency offsetestimator 1530 may be obtained by using Equation 6 shown below.

$\begin{matrix}{\omega_{0} = {\frac{1}{L}\mspace{14mu} \arg \left\{ {\sum\limits_{n = 1}^{K - 1}{\left( \frac{Z_{n}}{Z_{n}} \right)\left( \frac{Z_{n - 1}}{Z_{n - 1}} \right)^{*}}} \right\}}} & {{Equation}\mspace{14mu} 6}\end{matrix}$

The known data place detector and frequency offset decider 1420 storesthe output of the partial correlator corresponding to each samplingphase during an enhanced data group cycle or a pre-decided cycle. Then,among the stored correlation values, the known data place detector andfrequency offset decider 1420 decides the place (or position)corresponding to the highest correlation value as the place forreceiving the known data. Furthermore, the known data place detector andfrequency offset decider 1420 decides the estimated value of thefrequency offset taken (or estimated) at the point of the highestcorrelation value as the coarse frequency offset value of the receivingsystem. For example, if the output of the partial correlatorcorresponding to the second partial correlator 1412 is the highestvalue, the place corresponding to the highest value is decided as theknown data place. Thereafter, the coarse frequency offset estimated bythe second partial correlator 1412 is decided as the final coarsefrequency offset, which is then outputted to the demodulator 1002.

Meanwhile, the output of the second multiplier 1050 is temporarilystored in the decimator 1081 and the buffer 1082 both included in thetiming recovery unit 1080. Subsequently, the temporarily stored outputdata are inputted to the timing error detector 1083 through thedecimator 1081 and the buffer 1082. Assuming that the output of thesecond multiplier 1050 is oversampled to N times its initial state, thedecimator 1081 decimates the output of the second multiplier 1050 at adecimation rate of 1/N. Then, the 1/N-decimated data are inputted to thebuffer 1082. In other words, the decimator 1081 performs decimation onthe input signal in accordance with a VSB symbol cycle. Furthermore, thedecimator 1081 may also receive the output of the matched filter 1060instead of the output of the second multiplier 1050.

The timing error detector 1083 uses the data prior to or after beingprocessed with matched-filtering and the known sequence positionindicator outputted from the known data detector and initial frequencyoffset estimator 1004-1 in order to detect a timing error. Thereafter,the detected timing error is outputted to the loop filter 1084. Morespecifically, the timing error detector 1083 detects timing error fromthe known data sequence prior to or after being processed with matchedfiltering. Then, the timing error detector 1083 outputs the detectedtiming error to the loop filter 1084. Accordingly, the detected timingerror information is obtained once during each repetition cycle of theknown data sequence.

For example, if a known data sequence having the same pattern isperiodically inserted and transmitted, as shown in FIG. 31, the timingerror detector 1083 may use the known data in order to detect the timingerror. There exists a plurality of methods for detecting timing error byusing the known data. In the example of the present invention, thetiming error may be detected by using a correlation characteristicbetween the known data and the received data in the time domain, theknown data being already known in accordance with a pre-arrangedagreement between the transmitting system and the receiving system. Thetiming error may also be detected by using the correlationcharacteristic of the two known data types being received in thefrequency domain. Then, the detected timing error is outputted. Inanother example, a spectral lining method may be applied in order todetect the timing error. Herein, the spectral lining method correspondsto a method of detecting timing error by using sidebands of the spectrumincluded in the received signal.

The loop filter 1084 filters the timing error detected by the timingerror detector 1083 and, then, outputs the filtered timing error to theholder 1085. The holder 1085 holds (or maintains) the timing errorfiltered and outputted from the loop filter 1084 during a pre-determinedknown data sequence cycle period and outputs the processed timing errorto the NCO 1086. Herein, the positioning order of the loop filter 1084and the holder 1085 may be switched from one another. In addition, thefunction of the holder 1085 may be included in the loop filter 1084,and, accordingly, the holder 1085 may be omitted. The NCO 1086accumulates the timing error outputted from the holder 1085. Thereafter,the NCO 1086 outputs the phase element (i.e., a sampling clock) of theaccumulated timing error to the resampler 1040, thereby adjusting thesampling timing of the resampler 1040.

FIG. 38 illustrates a timing recovery unit according to anotherembodiment of the present invention. Referring to FIG. 38, the timingrecovery unit 1080 includes a first timing error detector 1611, a secondtiming error detector 1612, a multiplexer 1613, a loop filter 1614, andan NCO 1615. When the input signal is divided into a region includingknown data and a region not including any known data, the method fordetecting timing error may differ based upon whether or not the knowndata is included. Also, a suitable timing error detector may be used,based upon whether or not the known data is included. Therefore, itwould be efficient and advantageous to apply the example shown in FIG.38 when the transmitted input signal is divided into a region havingknown data of a predetermined length inserted in a pre-decided positionthereof (i.e., a first region) and a region having no known dataincluded therein (i.e., a second region).

For example, it is assumed that the first timing error detector 1611detects a first timing error using a sideband of a spectrumcorresponding to an input signal, and that the second timing errordetector 1612 detects a second timing error using the known data.Accordingly, the multiplexer 1613 may be designed to select the firsttiming error for the first region and to select the second timing errorfor the second region, thereby outputting the selected timing errors tothe loop filter 1614. Alternatively, the multiplexer 1613 may also bedesigned to output both of the first and second timing errors for thefirst region having the known data inserted therein. By using the knowndata in the first region, a more reliable timing error may be detected,thereby enabling the timing clock to be recovered with more stability.

There is a plurality of methods for detecting timing error using theknown data. In the description of the present invention, two methods fordetecting timing error will be disclosed. The first method relates todetecting timing error using a correlation characteristic in the timedomain between known data pre-known to a transmitting system and areceiving system (reference known data) and the known data actuallyreceived by the receiving system. And, the second method relates todetecting a timing error using a correlation characteristic in thefrequency domain between two sets of known data actually received by thereceiving system.

FIG. 39 and FIG. 40 respectively illustrate examples of detecting timingerror by calculating a correlation value between known data pre-known tothe transmitting system and the receiving system (i.e., reference knowndata generated from the receiving system) and the received signal.Firstly, FIG. 39( a) illustrates an example of shifting an entire knowndata sequence, which is repeated for each data block cycle period, inaccordance with the received signal (or known data) sequence, therebycalculating the correlation. At this point, the correlation valuebetween the known data sequence and the actually received signal (orknown data) corresponds to a maximum value or a peak value of the lastsymbol position of the known data sequence included in the receivedsignal, as shown in FIG. 39( b).

FIG. 40( a) illustrates an example of calculating correlation values bydividing the known data sequence into a plurality of portions. In thiscase, the peak values of the correlation values of the known data aregenerated at the last symbol position corresponding to the dividedportion of each known data sequence. Then, the by adding the generatedpeak values to a single value, a final peak value may be calculated.FIG. 40( b) illustrates a plurality of correlation values and a finalpeak value, which corresponds to the added value of the plurality ofcorrelation values, when the known data sequence is divided into threeportions.

The timing error may be calculated from a peak position of correlationvalues. When a single correlation value is calculated using an entireknown data sequence, as shown in FIG. 39, the timing error may bedetected once for each data block cycle period. However, when the knowndata signal is divided into a plurality of portions so as to calculatethe correlation values between the divided known data portions and thereceived signal, as shown in FIG. 40, a more accurate timing error maybe calculated (or obtained), in case the level of correlation for theentire known data sequence decreases. In this case, a number of peakcorrelation values corresponding to the number of divided known dataportions may be obtained.

The use of a final correlation value which is obtained by adding aplurality of correlation values of divided portions of a received knowndata sequence may reduce the carrier wave frequency error. In addition,the process time for the timing recovery can be greatly reduced when theplurality of correlation values are used to calculate the timing error.For example, when the reference known data sequence, which is pre-knownto the transmitting system and receiving system, is divided into Knumber of portions, K number of correlation values between the K numberof portions of the reference known data sequence and the correspondingdivided portions of the received known data sequence can be calculated,or any combination(s) of the correlation values can be used. Therefore,when using the entire known data sequence, the dispersion of the timingerror detection values may be reduced but the application cycle periodmay be extended. However, when using the divided portions of the knowndata sequence, even though the dispersion of the timing error detectionvalues may be slightly increased, as compared to when using the entireknown data sequence, the application cycle period may be reduced.

The timing error can be calculated from the peak value of thecorrelation values. The timing error is obtained for each data block ifan entire portion of the known data sequence is used, as shown in FIG.41. On the other hand, if K number of divided portions of the known datasequence are used for correlation calculation, as shown in FIG. 40, Knumber of correlation values and corresponding peak values can beobtained. This indicates that the timing error can be detected K numberof times.

A method of detecting a timing error using the correlation between thereference known data and the received known data, shown in FIG. 39 andFIG. 40, will now be described in more detail with reference to FIG. 41.Referring to FIG. 41, the bold dots respectively indicate correlationvalues between the reference known data and the received known data, andthe solid line broadly connects the flow of the dots. The dotsrespectively indicate correlation values corresponding to data samplessampled at a rate two times greater than the symbol clock. Referring toFIG. 41, when the random data effect is excluded, when there is nonoise, and when there is no timing clock error, the correlation valuesbetween the reference known data and the received known data arehorizontally symmetrical with the peak value as the axis, as shown bythe solid line of FIG. 41. However, if a timing phase error exists, thecorrelation values adjacent to the peak value are no longer symmetrical.Therefore, the timing error can be obtained by using a value inproportion with a difference between the correlation values before andafter the peak value.

FIG. 42 illustrates an example of the timing error detector detectingtiming error in the time domain using a correlation value between theabove-described known data and received signal. Referring to FIG. 42,the timing error detector includes a correlator 1701, a down sampler1702, an absolute value calculator 1703, a delay 1704, and a subtractor1705. The correlator 1701 receives a known data sequence sampled at arate at least two times higher than the symbol clock frequency andcalculates the correlation values between the received known datasequence and a reference known data sequence. The down sampler 1702performs down sampling on the correlation values and obtains sampleshaving a symbol frequency. For example, if the data inputted to thecorrelator 1701 are pre-sampled at a sampling rate of 2, then the downsampler 1702 performs down sampling at a rate of ½ to obtain sampleshaving the symbol frequency. The correlation value of the down sampler1702 is inputted to the absolute value calculator 1703. The absolutevalue calculator 1703 calculates absolute values (or square values) ofthe down-sampled correlation values. These absolute values are inputtedto the delay 1704 and the subtractor 1705. The delay 1704 delays theabsolute values for a symbol. Then, the subtractor 1705 outputs a timingerror by subtracting the delayed absolute value from the valuesoutputted from the absolute value calculator 1703. The differencebetween the outputted values corresponds to the value proportional tothe timing phase error.

The arrangement of the correlator 1701, the down sampler 1702, theabsolute value calculator 1703, and the delay 1704, and the subtractor1705, shown in FIG. 42, can be modified. For example, the timing phaseerror can be calculated in the order of the down sampler 1702, thecorrelator 1701, and the absolute value calculator 1703, or in the orderof the correlator 1701, the absolute value calculator 1703, and the downsampler 1702.

The timing error can also be obtained using the frequency characteristicof the known data. When there is a timing frequency error, a phase ofthe input signal increases at a fixed slope as the frequency of thesignal increases and this slope is different for current and next datablock. Therefore, the timing error can be calculated based on thefrequency characteristic of two different known data blocks.

FIG. 43 illustrates an example of detecting timing frequency error usinga frequency characteristic of the above-described known data. Referringto FIG. 43, a current known data sequence (right) and a previous knowndata sequence (left) are converted into first and second frequencydomain signals, respectively, using a Fast Fourier Transform (FFT)algorithm. The conjugate value of the first frequency domain signal isthen multiplied with the second frequency domain signal in order toobtain the correlation value between two frequency domain signals. Inother words, the correlation between the frequency value of the previousknown data sequence and the frequency value of the current known datasequence is used to detect a phase change between the known data blocksfor each frequency. Accordingly, the phase distortion of a channel canbe eliminated.

The frequency response of a complex VSB signal does not have a fullsymmetric distribution as shown in FIG. 41. Rather, its distribution isa left or right half of the distribution and the frequency domaincorrelation values also have a half distribution. In order to obtain thephase difference between the frequency domain correlation values, thefrequency domain having the correlation values can be divided into twosub-areas and a phase of a combined correlation value in each sub-areacan be obtained. Thereafter, the difference between the phases ofsub-areas can be used to calculate a timing frequency error. When aphase of a combined correlation values is used for each frequency, themagnitude of each correlation value is proportional to reliability and aphase component of each correlation value is reflected to the finalphase component in proportion to the magnitude.

FIG. 44 illustrates another example of detecting timing error shown inFIG. 43. Referring to FIG. 44, the timing error detector includes a fastfourier transform (FFT) unit 1801, a first delay 1802, a conjugator1803, a multiplier 1804, an adder 1805, a phase extractor 1806, a seconddelay 1807, and a subtractor 1808. The first delay 1802 delays for onedata block and the second delay 1807 delays for ¼ data block. One datablock includes a frequency response of a sequence of N number of knowndata symbol sequences. When a known data region is known and the datasymbols are received, the FFT unit 1801 converts complex values ofconsecutive N number of known data symbol sequences into complex valuesin the frequency domain. The first delay 1802 delays the frequencydomain complex values for a time corresponding to one data block. Theconjugator 1803 generates conjugate values of the delayed complexvalues. The multiplier 1804 multiplies the current block of known dataoutputted from the FFT unit 1801 with the previous block of known dataoutputted from the conjugator 1803. The output of the multiplier 1804represents frequency region correlation values within a known datablock.

Since the complex VSB data exist only on half of the frequency domain,the adder 1805 divides a data region in the known data block into twosub-regions and adds (or accumulates) correlation values for eachsub-region. The phase detector 1806 detects a phase of the accumulatedcorrelation value for each significant sub-region. The second delay 1807delays the detected phase for a time corresponding to a ¼ data block.The subtractor 1808 obtains a phase difference between the delayed phaseby ¼ data block from the second delay 1807 and the phase outputted fromthe phase extractor 1806 and outputs the phase difference as a timingfrequency error.

In the method of calculating a timing error by using a peak ofcorrelation between the reference known data and the received known datain the time domain, the contribution of the correlation values mayaffect a channel when the channel is a multiple path channel. However,this can be greatly eliminated if the timing error is obtained using thecorrelation between two sets of received known data. In addition, thetiming error can be detected using an entire portion of the known datasequence inserted by the transmitting system, or it can be detectedusing a portion of the known data sequence which is robust to random ornoise data.

Meanwhile, the DC remover 1070 removes pilot tone signal (i.e., DCsignal), which has been inserted by the transmitting system, from thematched-filtered signal. Thereafter, the DC remover 1070 outputs theprocessed signal to the phase compensator 1110.

FIG. 45 illustrates a detailed block diagram of a DC remover accordingto an embodiment of the present invention. Herein, identical signalprocessing processes are performed on each of a real number element (orin-phase (I)) and an imaginary number element (or a quadrature (Q)) ofthe inputted complex signal, thereby estimating and removing the DCvalue of each element. In order to do so, the DC remover shown in FIG.45 includes a first DC estimator and remover 1900 and a second DCestimator and remover 1950. Herein, the first DC estimator and remover1900 includes an R sample buffer 1901, a DC estimator 1902, an M sampleholder 1903, a C sample delay 1904, and a subtractor 1905. Herein, thefirst DC estimator and remover 1900 estimates and removes the DC of thereal number element (i.e., an in-phase DC).

Furthermore, the second DC estimator and remover 1950 includes an Rsample buffer 1951, a DC estimator 1952, an M sample holder 1953, a Csample delay 1954, and a subtractor 1955. The second DC estimator andremover 1950 estimates and removes the DC of the imaginary numberelement (i.e., a quadrature DC). In the present invention, the first DCestimator and remover 1900 and the second DC estimator and remover 1950may receive different input signals. However, each DC estimator andremover 1900 and 1950 has the same structure. Therefore, a detaileddescription of the first DC estimator and remover 1900 will be presentedherein, and the second DC estimator and remover 1950 will be omitted forsimplicity.

More specifically, the in-phase signal matched-filtered by the matchedfilter 1060 is inputted to the R sample buffer 1901 of the first DCestimator and remover 1900 within the DC remover 1070 and is thenstored. The R sample buffer 1901 is a buffer having the length of Rsample. Herein, the output of the R sample buffer 1901 is inputted tothe DC estimator 1902 and the C sample delay 1904. The DC estimator 1902uses the data having the length of R sample, which are outputted fromthe buffer 1901, so as to estimate the DC value by using Equation 7shown below.

$\begin{matrix}{{y\lbrack n\rbrack} = {\frac{1}{R}{\sum\limits_{k = 0}^{R - 1}{x\left\lbrack {k + {M*n}} \right\rbrack}}}} & {{Equation}\mspace{14mu} 7}\end{matrix}$

In the above-described Equation 7, x[n] represents the inputted sampledata stored in the buffer 1901. And, y[n] indicates the DC estimationvalue. More specifically, the DC estimator 1902 accumulates R number ofsample data stored in the buffer 1901 and estimates the DC value bydividing the accumulated value by R. At this point, the stored inputsample data set is shifted as much as M sample. Herein, the DCestimation value is outputted once every M samples.

FIG. 46 illustrates a shifting of the input sample data used for DCestimation. For example, when M is equal to 1 (i.e., M=1), the DCestimator 1902 estimates the DC value each time a sample is shifted tothe buffer 1901. Accordingly, each estimated result is outputted foreach sample. If M is equal to R (i.e., M=R), the DC estimator 1902estimates the DC value each time R number of samples are shifted to thebuffer 1901. Accordingly, each estimated result is outputted for eachcycle of R samples. Therefore, in this case, the DC estimator 1902corresponds to a DC estimator that operates in a block unit of Rsamples. Herein, any value within the range of 1 and R may correspond tothe value M.

As described above, since the output of the DC estimator 1902 isoutputted after each cycle of M samples, the M sample holder 1903 holdsthe DC value estimated from the DC estimator 1902 for a period of Msamples. Then, the estimated DC value is outputted to the subtractor1905. Also, the C sample delay 1904 delays the input sample data storedin the buffer 1901 by C samples, which are then outputted to thesubtractor 1905. The subtractor 1905 subtracts the output of the Msample holder 1903 from the output of the C sample delay 1904.Thereafter, the subtractor 1905 outputs the signal having the in-phaseDC removed.

Herein, the C sample delay 1904 decides which portion of the inputsample data is to be compensated with the output of the DC estimator1902. More specifically, the DC estimator and remover 1900 may bedivided into a DC estimator 1902 for estimating the DC and thesubtractor for compensating the input sample data within the estimatedDC value. At this point, the C sample delay 1904 decides which portionof the input sample data is to be compensated with the estimated DCvalue. For example, when C is equal to 0 (i.e., C=0), the beginning ofthe R samples is compensated with the estimated DC value obtained byusing R samples. Alternatively, when C is equal to R (i.e., C=R), theend of the R samples is compensated with the estimated DC value obtainedby using R samples. Similarly, the data having the DC removed areinputted to the buffer 1111 and the frequency offset estimator 1112 ofthe phase compensator 1110.

Meanwhile, FIG. 47 illustrates a detailed block diagram of a DC removeraccording to another embodiment of the present invention. Herein,identical signal processing processes are performed on each of a realnumber element (or in-phase (I)) and an imaginary number element (or aquadrature (Q)) of the inputted complex signal, thereby estimating andremoving the DC value of each element. In order to do so, the DC removershown in FIG. 47 includes a first DC estimator and remover 2100 and asecond DC estimator and remover 2150. FIG. 47 corresponds to an infiniteimpulse response (IIR) structure.

Herein, the first DC estimator and remover 2100 includes a multiplier2101, an adder 2102, a 1 sample delay 2103, a multiplier 2104, a Csample delay 2105, and a subtractor 2106. Also, the second DC estimatorand remover 2150 includes a multiplier 2151, an adder 2152, a 1 sampledelay 2153, a multiplier 2154, a C sample delay 2155, and a subtractor2156. In the present invention, the first DC estimator and remover 2100and the second DC estimator and remover 2150 may receive different inputsignals. However, each DC estimator and remover 2100 and 2150 has thesame structure. Therefore, a detailed description of the first DCestimator and remover 2100 will be presented herein, and the second DCestimator and remover 2150 will be omitted for simplicity.

More specifically, the in-phase signal matched-filtered by the matchedfilter 1060 is inputted to the multiplier 2101 and the C sample delay2105 of the first DC estimator and remover 2100 within the DC remover1070. The multiplier 2101 multiplies a pre-determined constant α to thein-phase signal that is being inputted. Then, the multiplier 2101outputs the multiplied result to the adder 2102. The adder 2102 adds theoutput of the multiplier 2101 to the output of the multiplier 2104 thatis being fed-back. Thereafter, the adder 2102 outputs the added resultto the 1 sample delay 2103 and the subtractor 2106. More specifically,the output of the adder 2102 corresponds to the estimated in-phase DCvalue.

The 1 sample delay 2103 delays the estimated DC value by 1 sample andoutputs the DC value delayed by 1 sample to the multiplier 2104. Themultiplier 2104 multiplies a pre-determined constant (1-a) to the DCvalue delayed by 1 sample. Then, the multiplier 2104 feeds-back themultiplied result to the adder 2102. Subsequently, the C sample delay2105 delays the in-phase sample data by C samples and, then, outputs thedelayed in-phase sample data to the subtractor 2106. The subtractor 2106subtracts the output of the adder 2102 from the output of the C sampledelay 2105, thereby outputting the signal having the in-phase DC removedtherefrom.

Similarly, the data having the DC removed are inputted to the buffer1111 and the frequency offset estimator 1112 of the phase compensator1110. The frequency offset estimator 1112 uses the known sequenceposition indicator outputted from the known sequence detector andinitial frequency offset estimator 9041 in order to estimate thefrequency offset from the known data sequence that is being inputted,the known data sequence having the DC removed by the DC remover 1070.Then, the frequency offset estimator 1112 outputs the estimatedfrequency offset to the holder 1113. Similarly, the frequency offsetestimation value is obtained at each repetition cycle of the known datasequence. Therefore, the holder 1113 holds the frequency offsetestimation value during a cycle period of the known data sequence andthen outputs the frequency offset estimation value to the NCO 1114. TheNCO 1114 generates a complex signal corresponding to the frequencyoffset held by the holder 1113 and outputs the generated complex signalto the multiplier 1115.

The multiplier 1115 multiplies the complex signal outputted from the NCO1114 to the data being delayed by a set period of time in the buffer1111, thereby compensating the phase change included in the delayeddata. The data having the phase change compensated by the multiplier1115 pass through the decimator 1200 so as to be inputted to theequalizer 1003. At this point, since the frequency offset estimated bythe frequency offset estimator 1112 of the phase compensator 1110 doesnot pass through the loop filter, the estimated frequency offsetindicates the phase difference between the known data sequences. Inother words, the estimated frequency offset indicates a phase offset.

Channel Equalizer within Receiving System

The demodulated data using the known data in the demodulator 1002 isinputted to the channel equalizer 1003. The demodulated data is inputtedto the known sequence detector 1004. The equalizer 1003 may performchannel equalization by using a plurality of methods. An example ofestimating a channel impulse response (CIR) so as to perform channelequalization will be given in the description of the present invention.Most particularly, an example of estimating the CIR in accordance witheach region within the data group, which is hierarchically divided andtransmitted from the transmitting system, and applying each CIRdifferently will also be described herein. Furthermore, by using theknown data, the place and contents of which is known in accordance withan agreement between the transmitting system and the receiving system,and/or the field synchronization data, so as to estimate the CIR, thepresent invention may be able to perform channel equalization with morestability.

Herein, a data group that is inputted for the equalization process isdivided into regions A to D, as shown in FIG. 7A. More specifically, inthe example of the present invention, each region A, B, C, and D arefurther divided into sub-regions A1 to A5, sub-regions B1 and B2, andsub-regions C1 to C3, respectively. Referring to FIG. 7A, the CIR thatis estimated from the field synchronization data in the data structureis referred to as CIR_FS. Alternatively, the CIRs that are estimatedfrom each of the 5 known data sequences existing in region A aresequentially referred to as CIR_N0, CIR_N1, CIR_N2, CIR_N3, and CIR_N4.

As described above, the present invention uses the CIR estimated fromthe field synchronization data and the known data sequences in order toperform channel equalization on data within the data group. At thispoint, each of the estimated CIRs may be directly used in accordancewith the characteristics of each region within the data group.Alternatively, a plurality of the estimated CIRs may also be eitherinterpolated or extrapolated so as to create a new CIR, which is thenused for the channel equalization process.

Herein, when a value F(Q) of a function F(x) at a particular point Q anda value F(S) of the function F(x) at another particular point S areknown, interpolation refers to estimating a function value of a pointwithin the section between points Q and S. Linear interpolationcorresponds to the simplest form among a wide range of interpolationoperations. The linear interpolation described herein is merelyexemplary among a wide range of possible interpolation methods. And,therefore, the present invention is not limited only to the examples setforth herein.

Alternatively, when a value F(Q) of a function F(x) at a particularpoint Q and a value F(S) of the function F(x) at another particularpoint S are known, extrapolation refers to estimating a function valueof a point outside of the section between points Q and S. Linearextrapolation is the simplest form among a wide range of extrapolationoperations. Similarly, the linear extrapolation described herein ismerely exemplary among a wide range of possible extrapolation methods.And, therefore, the present invention is not limited only to theexamples set forth herein.

FIG. 48 is a flow chart illustrating a channel equalization methodaccording to one aspect of the present invention. An input data group(current data group) is temporarily stored (Step 2301), and CIRs of thefield synchronization data and the known data sequences included in thestored data group are estimated (Step 2302). In step 2301, a portion ofthe data group can be stored, because sub-regions B1, C1, and A1 arereceived before the first known data region, and because the channelequalization for sub-regions B1, C1, and A1 are performed using a CIRestimated from the first known data region.

In step 2303, the channel equalization for sub-region C1 of a currentdata group may be performed using a CIR which is estimated byextrapolating CIR_FS and CIR_N0 estimated from the first known dataregion. Alternatively, the channel equalization for sub-region C1 of thecurrent data group can be performed using any one of CIR_N4 estimatedfrom a previous data group and CIR_FS estimated from the current datagroup. If the extrapolated CIR is used, the data included in sub-regionC1 must be stored until CIR_N0 is estimated because the sub-region C1data are inputted before the first known data region in the current datagroup. The data included in sub-region C1 can be stored in a partialregion of an external memory (e.g., RAM) within the broadcast receivingsystem, or in a separate storage unit (or memory).

In step 2303, the channel equalization for sub-region B1 of a currentdata group may be performed using a CIR which is estimated byextrapolating CIR_FS and CIR_N0 estimated from the current data group.In a further example, the channel equalization for sub-region B1 can beperformed using CIR_FS of the current data group. Similarly, the dataincluded in the sub-region B1 must be stored until CIR_N0 (or CIR_FS) isestimated because the sub-region B1 data are inputted before the firstknown data region. The data included in sub-region B1 can be stored in apartial region of an external memory (e.g., RAM) within the broadcastreceiving system, or in a separate storage unit (or memory).

In step 2304, the channel equalization for sub-region A1 of a currentdata group may be performed using a CIR which is estimated byinterpolating CIR_FS and CIR_N0 estimated from the current data group.Alternatively, the channel equalization for sub-region A1 can beperformed using any one of CIR_FS and CIR_N0 estimated from thecurrently data group. If sub-region A1 is equalized using theinterpolated CIR, the data included in sub-region A1 must be storeduntil CIR_N0 is estimated. The data included in sub-region A1 can bestored in a partial region of an external memory (e.g., RAM) within thebroadcast receiving system, or in a separate storage unit (or memory).

For sub-regions A2 to A5 of a current data group, the channelequalization may be performed using a CIR which is estimated byinterpolating CIR_N (i−1) and CIR_N(i) of the current data group (Step2305). Alternatively, the channel equalization may be performed usingany one of CIR_N(i−1) and CIR_N(i). In step 2306, the channelequalization for sub-regions B2, C2, and C3 may be performed using a CIRestimated by interpolating CIR_N3 and CIR_N4 estimated from the currentdata group. Alternatively, the channel equalization may be performedusing CIR_N4 estimated from the current data group. Accordingly, anoptimum performance may be yielded when performing channel equalizationon the data inserted in the data group.

FIG. 49 illustrates a block diagram of a channel equalizer according toanother embodiment of the present invention. Referring to FIG. 49, thechannel equalizer includes a first frequency domain converter 3100, achannel estimator 3110, a second frequency domain converter 3121, acoefficient calculator 3122, a distortion compensator 3130, a timedomain converter 3140, a remaining carrier phase error remover 3150, anoise canceller (NC) 3160, and a decision unit 3170. Herein, the firstfrequency domain converter 3100 includes an overlap unit 3101overlapping inputted data, and a fast fourier transform (FFT) unit 3102converting the data outputted from the overlap unit 3101 to frequencydomain data. The channel estimator 3110 includes a CIR estimator 3111, aphase compensator 3112, a pre-CIR cleaner 3113, CIRinterpolator/extrapolator 3114, a post-CIR cleaner, and a zero-paddingunit 3116.

The second frequency domain converter 3121 includes a fast fouriertransform (FFT) unit converting the CIR being outputted from the channelestimator 3110 to a frequency domain CIR. The time domain converter 3140includes an IFFT unit 3141 converting the data having the distortioncompensated by the distortion compensator 3130 to time domain data, anda save unit 3142 extracting only valid data from the data outputted fromthe IFFT unit 3141. The remaining carrier phase error remover 3150includes an error compensator 3151 removing the remaining carrier phaseerror included in the channel equalized data, and a remaining carrierphase error estimator 3152 using the channel equalized data and thedecision data of the decision unit 3170 so as to estimate the remainingcarrier phase error, thereby outputting the estimated error to the errorcompensator 3151. Herein, any device performing complex numbermultiplication may be used as the distortion compensator 3130 and theerror compensator 3151.

At this point, since the received data correspond to data modulated toVSB type data, 8-level scattered data exist only in the real numberelement. Therefore, referring to FIG. 49, all of the signals used in thenoise canceller 3160 and the decision unit 3170 correspond to realnumber (or in-phase) signals. However, in order to estimate andcompensate the remaining carrier phase error and the phase noise, bothreal number (in-phase) element and imaginary number (quadrature) elementare required. Therefore, the remaining carrier phase error remover 3150receives and uses the quadrature element as well as the in-phaseelement.

Generally, prior to performing the channel equalization process, thedemodulator 902 within the receiving system performs frequency and phaserecovery of the carrier. However, if a remaining carrier phase errorthat is not sufficiently compensated is inputted to the channelequalizer, the performance of the channel equalizer may be deteriorated.Particularly, in a dynamic channel environment, the remaining carrierphase error may be larger than in a static channel environment due tothe frequent and sudden channel changes. Eventually, this acts as animportant factor that deteriorates the receiving performance of thepresent invention.

Furthermore, a local oscillator (not shown) included in the receivingsystem should preferably include a single frequency element. However,the local oscillator actually includes the desired frequency elements aswell as other frequency elements. Such unwanted (or undesired) frequencyelements are referred to as phase noise of the local oscillator. Suchphase noise also deteriorates the receiving performance of the presentinvention. It is difficult to compensate such remaining carrier phaseerror and phase noise from the general channel equalizer. Therefore, thepresent invention may enhance the channel equaling performance byincluding a carrier recovery loop (i.e., a remaining carrier phase errorremover 3150) in the channel equalizer, as shown in FIG. 49, in order toremove the remaining carrier phase error and the phase noise.

More specifically, the receiving data demodulated in FIG. 49 areoverlapped by the overlap unit 3101 of the first frequency domainconverter 3100 at a pre-determined overlapping ratio, which are thenoutputted to the FFT unit 3102. The FFT unit 3102 converts theoverlapped time domain data to overlapped frequency domain data throughby processing the data with FFT. Then, the converted data are outputtedto the distortion compensator 3130. The distortion compensator 3130performs a complex number multiplication on the overlapped frequencydomain data outputted from the FFT unit 3102 included in the firstfrequency domain converter 3100 and the equalization coefficientcalculated from the coefficient calculator 3122, thereby compensatingthe channel distortion of the overlapped data outputted from the FFTunit 3102. Thereafter, the compensated data are outputted to the IFFTunit 3141 of the time domain converter 3140. The IFFT unit 3141 performsIFFT on the overlapped data having the channel distortion compensated,thereby converting the overlapped data to time domain data, which arethen outputted to the error compensator 3151 of the remaining carrierphase error remover 3150.

The error compensator 3151 multiplies a signal compensating theestimated remaining carrier phase error and phase noise with the validdata extracted from the time domain. Thus, the error compensator 3151removes the remaining carrier phase error and phase noise included inthe valid data. The data having the remaining carrier phase errorcompensated by the error compensator 3151 are outputted to the remainingcarrier phase error estimator 3152 in order to estimate the remainingcarrier phase error and phase noise and, at the same time, outputted tothe noise canceller 3160 in order to remove (or cancel) the noise.

The remaining carrier phase error estimator 3152 uses the output data ofthe error compensator 3151 and the decision data of the decision unit3170 to estimate the remaining carrier phase error and phase noise.Thereafter, the remaining carrier phase error estimator 3152 outputs asignal for compensating the estimated remaining carrier phase error andphase noise to the error compensator 3151. In this embodiment of thepresent invention, an inverse number of the estimated remaining carrierphase error and phase noise is outputted as the signal for compensatingthe remaining carrier phase error and phase noise.

FIG. 50 illustrates a detailed block diagram of the remaining carrierphase error estimator 3152 according to an embodiment of the presentinvention. Herein, the remaining carrier phase error estimator 3152includes a phase error detector 3211, a loop filter 3212, a numericallycontrolled oscillator (NCO) 3213, and a conjugator 3214. Referring toFIG. 50, the decision data, the output of the phase error detector 3211,and the output of the loop filter 3212 are all real number signals. And,the output of the error compensator 3151, the output of the NCO 3213,and the output of the conjugator 3214 are all complex number signals.

The phase error detector 3211 receives the output data of the errorcompensator 3151 and the decision data of the decision unit 3170 inorder to estimate the remaining carrier phase error and phase noise.Then, the phase error detector 3211 outputs the estimated remainingcarrier phase error and phase noise to the loop filter. The loop filter3212 then filters the remaining carrier phase error and phase noise,thereby outputting the filtered result to the NCO 3213. The NCO 3213generates a cosine corresponding to the filtered remaining carrier phaseerror and phase noise, which is then outputted to the conjugator 3214.

The conjugator 3214 calculates the conjugate value of the cosine wavegenerated by the NCO 3213. Thereafter, the calculated conjugate value isoutputted to the error compensator 3151. At this point, the output dataof the conjugator 3214 becomes the inverse number of the signalcompensating the remaining carrier phase error and phase noise. In otherwords, the output data of the conjugator 3214 becomes the inverse numberof the remaining carrier phase error and phase noise.

The error compensator 3151 performs complex number multiplication on theequalized data outputted from the time domain converter 3140 and thesignal outputted from the conjugator 3214 and compensating the remainingcarrier phase error and phase noise, thereby removing the remainingcarrier phase error and phase noise included in the equalized data.Meanwhile, the phase error detector 3211 may estimate the remainingcarrier phase error and phase noise by using diverse methods andstructures. According to this embodiment of the present invention, theremaining carrier phase error and phase noise are estimated by using adecision-directed method.

If the remaining carrier phase error and phase noise are not included inthe channel-equalized data, the decision-directed phase error detectoraccording to the present invention uses the fact that only real numbervalues exist in the correlation values between the channel-equalizeddata and the decision data. More specifically, if the remaining carrierphase error and phase noise are not included, and when the input data ofthe phase error detector 3211 are referred to as x_(i)+jx_(q), thecorrelation value between the input data of the phase error detector3211 and the decision data may be obtained by using Equation 8 shownbelow:

E{(x_(i)+jx_(q))({circumflex over (x)}_(i)+j{circumflex over(x)}_(q))*}  Equation 8

At this point, there is no correlation between x_(i) and x_(q).Therefore, the correlation value between x_(i) and x_(q) is equal to 0.Accordingly, if the remaining carrier phase error and phase noise arenot included, only the real number values exist herein. However, if theremaining carrier phase error and phase noise are included, the realnumber element is shown in the imaginary number value, and the imaginarynumber element is shown in the real number value. Thus, in this case,the imaginary number element is shown in the correlation value.Therefore, it can be assumed that the imaginary number portion of thecorrelation value is in proportion with the remaining carrier phaseerror and phase noise. Accordingly, as shown in Equation 9 below, theimaginary number of the correlation value may be used as the remainingcarrier phase error and phase noise.

Phase Error=imag{(x _(i) +jx _(q))({circumflex over (x)} _(i)+j{circumflex over (x)} _(q))*}

Phase Error=x _(q) {circumflex over (x)} _(i) −x _(i) {circumflex over(x)} _(q)  Equation 9

FIG. 51 illustrates a block diagram of a phase error detector 3211obtaining the remaining carrier phase error and phase noise. Herein, thephase error detector 3211 includes a Hilbert converter 3311, a complexnumber configurator 3312, a conjugator 3313, a multiplier 3314, and aphase error output 3315. More specifically, the Hilbert converter 3311creates an imaginary number decision data {circumflex over (x)}_(q) byperforming a Hilbert conversion on the decision value {circumflex over(x)}_(i) of the decision unit 3170. The generated imaginary numberdecision value is then outputted to the complex number configurator3312. The complex number configurator 3312 uses the decision data{circumflex over (x)}_(i) and {circumflex over (x)}_(q) to configure thecomplex number decision data {circumflex over (x)}_(i)+j{circumflex over(x)}_(q), which are then outputted to the conjugator 3313. Theconjugator 3313 conjugates the output of the complex number configurator3312, thereby outputting the conjugated value to the multiplier 3314.The multiplier 3314 performs a complex number multiplication on theoutput data of the error compensator 3151 and the output data{circumflex over (x)}_(i)−j{circumflex over (x)}_(q) of the conjugator3313, thereby obtaining the correlation between the output data{circumflex over (x)}_(i)+j{circumflex over (x)}_(q) of the errorcompensator 3151 and the decision value {circumflex over(x)}_(i)−j{circumflex over (x)}_(q) of the decision unit 3170. Thecorrelation data obtained from the multiplier 3314 are then inputted tothe phase error output 3315. The phase error output 3315 outputs theimaginary number portion x_(q){circumflex over (x)}_(i)−x_(i){circumflexover (x)}_(q) of the correlation data outputted from the multiplier 3314as the remaining carrier phase error and phase noise.

The phase error detector shown in FIG. 51 is an example of a pluralityof phase error detecting methods. Therefore, other types of phase errordetectors may be used in the present invention. Therefore, the presentinvention is not limited only to the examples and embodiments presentedin the description of the present invention. Furthermore, according toanother embodiment of the present invention, at least 2 phase errordetectors are combined so as to detect the remaining carrier phase errorand phase noise.

Accordingly, the output of the remaining carrier phase error remover3150 having the detected remaining carrier phase error and phase noiseremoved as described above, is configured of an addition of the original(or initial) signal having the channel equalization, the remainingcarrier phase error and phase noise, and the signal corresponding to awhite noise being amplified to a colored noise during the channelequalization.

Therefore, the noise canceller 3160 receives the output data of theremaining carrier phase error remover 3150 and the decision data of thedecision unit 3170, thereby estimating the colored noise. Then, thenoise canceller 3160 subtracts the estimated colored noise from the datahaving the remaining carrier phase error and phase noise removedtherefrom, thereby removing the noise amplified during the equalizationprocess.

In order to do so, the noise canceller 3160 includes a subtractor and anoise predictor. More specifically, the subtractor subtracts the noisepredicted by the noise predictor from the output data of the residualcarrier phase error estimator 3150. Then, the subtractor outputs thesignal from which amplified noise is cancelled (or removed) for datarecovery and, simultaneously, outputs the same signal to the decisionunit 3170. The noise predictor calculates a noise element by subtractingthe output of the decision unit 3170 from the signal having residualcarrier phase error removed therefrom by the residual carrier phaseerror estimator 3150. Thereafter, the noise predictor uses thecalculated noise element as input data of a filter included in the noisepredictor. Also, the noise predictor uses the filter (not shown) inorder to predict any color noise element included in the output symbolof the residual carrier phase error estimator 3150. Accordingly, thenoise predictor outputs the predicted color noise element to thesubtractor.

The data having the noise removed (or cancelled) by the noise canceller3160 are outputted for the data decoding process and, at the same time,outputted to the decision unit 3170. The decision unit 3170 selects oneof a plurality of pre-determined decision data sets (e.g., 8 decisiondata sets) that is most approximate to the output data of the noisecanceller 3160, thereby outputting the selected data to the remainingcarrier phase error estimator 3152 and the noise canceller 3160.Meanwhile, the received data are inputted to the overlap unit 3101 ofthe first frequency domain converter 3100 included in the channelequalizer and, at the same time, inputted to the CIR estimator 3111 ofthe channel estimator 3110.

The CIR estimator 3111 uses a training sequence, for example, data beinginputted during the known data section and the known data in order toestimate the CIR, thereby outputting the estimated CIR to the phasecompensator 3112. More specifically, the CIR estimator 3111 uses thedata being received during the known data section and the known data ofthe known data section, which are pre-known by the receiving systembased upon an agreement between the transmitting system and thereceiving system, so as to estimate the channel impulse response (CIR_N0to CIR_N4). In order to do so, the CIR estimator 3111 is provided with aknown data position information, wherein a second known data pattern istransmitted from the known data detector 1004. Also, since the secondknown data pattern of the known data section correspond to datapre-known based upon an agreement between the transmitting system andthe receiving system, the second known data pattern may be pre-stored inthe CIR estimator 3111, or a second known data pattern generated fromthe known data detector 1004 may be received and used.

Additionally, the CIR estimator 3111 uses the data received during thefield synchronization section and the field synchronization data of thefield synchronization section, which are pre-known by the receivingsystem based upon an agreement between the transmitting system and thereceiving system, so as to estimate the channel impulse response(CIR_FS). In order to do so, the CIR estimator 3111 is provided with afield synchronization position information from the known data detector1004. Also, since the field synchronization data of the fieldsynchronization section correspond to data pre-known based upon anagreement between the transmitting system and the receiving system, thefield synchronization data may be pre-stored in the CIR estimator 3111,or field synchronization data generated from the known data detector1004 may be received and used.

Furthermore, in this embodiment of the present invention, the CIRestimator 3111 estimates the CIR by using the least square (LS) method.The LS estimation method calculates a cross correlation value p betweenthe known data that have passed through the channel during the knowndata section and the known data that are already known by the receivingend. Then, a cross correlation matrix R of the known data is calculated.Subsequently, a matrix operation is performed on R⁻¹·p so that the crosscorrelation portion within the cross correlation value p between thereceived data and the initial known data, thereby estimating the CIR ofthe transmission channel.

The phase compensator 3112 compensates the phase change of the estimatedCIR. Then, the phase compensator 3112 outputs the compensated CIR to thefirst cleaner 3113 or the CIR interpolator-extrapolator 3114. At thispoint, the phase compensator 3112 may compensate the phase change of theestimated CIR by using a maximum likelihood method. More specifically,the remaining carrier phase error and phase noise that are included inthe demodulated received data and, therefore, being inputted change thephase of the CIR estimated by the CIR estimator 3111 at a cycle periodof one known data sequence. At this point, if the phase change of theinputted CIR, which is to be used for the linear interpolation process,is not performed in a linear form due to a high rate of the phasechange, the channel equalizing performance of the present invention maybe deteriorated when the channel is compensated by calculating theequalization coefficient from the CIR, which is estimated by a linearinterpolation method.

Therefore, the present invention removes (or cancels) the amount ofphase change of the CIR estimated by the CIR estimator 3111 so that thedistortion compensator 3130 allows the remaining carrier phase error andphase noise to bypass the distortion compensator 3130 without beingcompensated. Accordingly, the remaining carrier phase error and phasenoise are compensated by the remaining carrier phase error remover 3150.In order to do so, the present invention removes (or cancels) the amountof phase change of the CIR estimated by the phase compensator 3112 byusing a maximum likelihood method.

The basic idea of the maximum likelihood method relates to estimating aphase element mutually (or commonly) existing in all CIR elements, thento multiply the estimated CIR with an inverse number of the mutual (orcommon) phase element, so that the channel equalizer, and mostparticularly, the distortion compensator 3130 does not compensate themutual phase element. More specifically, when the mutual phase elementis referred to as θ, the phase of the newly estimated CIR is rotated byθ as compared to the previously estimated CIR. When the CIR of a point tis referred to as h_(i)(t), the maximum likelihood phase compensationmethod obtains a phase θ_(ML) corresponding to when h_(i)(t) is rotatedby θ, the squared value of the difference between the CIR of h_(i)(t)and the CIR of h_(i)(t+1), i.e., the CIR of a point (t+1), becomes aminimum value. Herein, when i represents a tap of the estimated CIR, andwhen N represents a number of taps of the CIR being estimated by the CIRestimator 3111, the value of θ_(ML) is equal to or greater than 0 andequal to or less than N−1. This value may be calculated by usingEquation 10 shown below:

$\begin{matrix}{\theta_{ML} = \; {\underset{\theta}{\overset{\min}{\;}}{\sum\limits_{i = 0}^{N - 1}{{{{h_{i}(t)}^{j\theta}} - {h_{i}\left( {t + 1} \right)}}}^{2}}}} & {{Equation}\mspace{14mu} 10}\end{matrix}$

Herein, in light of the maximum likelihood method, the mutual phaseelement θ_(ML) is equal to the value of θ, when the right side ofEquation 10 being differentiated with respect to θ is equal to 0. Theabove-described condition is shown in Equation 11 below:

$\begin{matrix}\begin{matrix}{{\frac{}{\theta}{\sum\limits_{i = 0}^{N - 1}{\begin{matrix}{{{h_{i}(t)}^{j\theta}} -} \\{h_{i}\left( {t + 1} \right)}\end{matrix}}^{2}}} = {\frac{}{\theta}{\sum\limits_{i = 0}^{N - 1}{\begin{pmatrix}{{{h_{i}(t)}^{j\theta}} -} \\{h_{i}\left( {t + 1} \right)}\end{pmatrix}\begin{pmatrix}{{{h_{i}(t)}^{j\theta}} -} \\{h_{i}\left( {t + 1} \right)}\end{pmatrix}^{*}}}}} \\{= {\frac{}{\theta}{\sum\limits_{i = 0}^{N - 1}\begin{Bmatrix}{{{h_{i}(t)}}^{2} + {h_{i + 1}}^{2} -} \\{{{h_{i}(t)}{h_{i}^{*}\left( {t + 1} \right)}^{j\theta}} -} \\{{h_{i}(t)}{h_{i}\left( {t + 1} \right)}^{- {j\theta}}}\end{Bmatrix}}}} \\{= {\sum\limits_{i = 0}^{N - 1}\begin{Bmatrix}{{j\; {h_{i}^{*}(t)}{h_{1}\left( {t + 1} \right)}^{- {j\theta}}} -} \\{j\; {h_{i}^{*}(t)}{h_{i}\left( {t + 1} \right)}^{j\theta}}\end{Bmatrix}}} \\{= {{j{\sum\limits_{i = 0}^{N - 1}{2{Im}\left\{ {{h_{i}^{*}(t)}{h_{i}\left( {t + 1} \right)}^{- {j\theta}}} \right\}}}} = 0}}\end{matrix} & {{Equation}\mspace{14mu} 11}\end{matrix}$

The above Equation 11 may be simplified as shown in Equation 12 below:

$\begin{matrix}{{{{Im}\left\{ {^{- {j\theta}}{\sum\limits_{i = 0}^{N - 1}\left\{ {{h_{i}^{*}(t)}{h_{i}\left( {t + 1} \right)}} \right\}}} \right\}} = 0}{\theta_{ML} = {\arg \left( {\sum\limits_{i = 0}^{N - 1}{{h_{i}^{*}(t)}{h_{i}\left( {t + 1} \right)}}} \right)}}} & {{Equation}\mspace{14mu} 12}\end{matrix}$

More specifically, Equation 12 corresponds to the θ_(ML) value that isto be estimated by the argument of the correlation value betweenh_(i)(t) and h_(i)(t+1).

FIG. 52 illustrates a phase compensator according to an embodiment ofthe present invention, wherein the mutual phase element θ_(ML) iscalculated as described above, and wherein the estimated phase elementis compensated at the estimated CIR. Referring to FIG. 52, the phasecompensator includes a correlation calculator 3410, a phase changeestimator 3420, a compensation signal generator 3430, and a multiplier3440. The correlation calculator 3410 includes a first N symbol buffer3411, an N symbol delay 3412, a second N symbol buffer 3413, aconjugator 3414, and a multiplier 3415.

More specifically, the first N symbol buffer 3411 included in thecorrelation calculator 3410 is capable of storing the data beinginputted from the CIR estimator 3111 in symbol units to a maximum limitof N number of symbols. The symbol data being temporarily stored in thefirst N symbol buffer 3411 are then inputted to the multiplier 3415included in the correlation calculator 3410 and to the multiplier 3440.At the same time, the symbol data being outputted from the CIR estimator3111 are delayed by N symbols from the N symbol delay 3412. Then, thedelayed symbol data pass through the second N symbol buffer 3413 andinputted to the conjugator 3414, so as to be conjugated and theninputted to the multiplier 3415.

The multiplier 3415 multiplies the output of the first N symbol buffer3411 and the output of the conjugator 3414. Then, the multiplier 3415outputs the multiplied result to an accumulator 3421 included in thephase change estimator 3420. More specifically, the correlationcalculator 3410 calculates a correlation between a current CIRh_(i)(t+1) having the length of N and a previous CIR h_(i)(t) alsohaving the length of N. Then, the correlation calculator 3410 outputsthe calculated correlation value to the accumulator 3421 of the phasechange estimator 3420.

The accumulator 3421 accumulates the correlation values outputted fromthe multiplier 3415 during an N symbol period. Then, the accumulator3421 outputs the accumulated value to the phase detector 3422. The phasedetector 3422 then calculates a mutual phase element θ_(ML) from theoutput of the accumulator 3421 as shown in the above-described Equation11. Thereafter, the calculated θ_(ML) value is outputted to thecompensation signal generator 3430. The compensation signal generator3430 outputs a complex signal e^(−jθ) ^(ML) having a phase opposite tothat of the detected phase as the phase compensation signal to themultiplier 3440. The multiplier 3440 multiplies the current CIRh_(i)(t+1) being outputted from the first N symbol buffer 3411 with thephase compensation signal e^(−jθ) ^(ML) , thereby removing the amount ofphase change of the estimated CIR.

The CIR having its phase change compensated, as described above, passesthrough a first cleaner (or pre-CIR cleaner) 3113 or bypasses the firstcleaner 3113, thereby being inputted to a CIR calculator (or CIRinterpolator-extrapolator) 3114. The CIR interpolator-extrapolator 3114either interpolates or extrapolates an estimated CIR, which is thenoutputted to a second cleaner (or post-CIR cleaner) 3115. Herein, theestimated CIR corresponds to a CIR having its phase change compensated.The first cleaner 3113 may or may not operate depending upon whether theCIR interpolator-extrapolator 3114 interpolates or extrapolates theestimated CIR. For example, if the CIR interpolator-extrapolator 3114interpolates the estimated CIR, the first cleaner 3113 does not operate.Conversely, if the CIR interpolator-extrapolator 3114 extrapolates theestimated CIR, the first cleaner 3113 operates.

More specifically, the CIR estimated from the known data includes achannel element that is to be obtained as well as a jitter elementcaused by noise. Since such jitter element deteriorates the performanceof the equalizer, it preferable that a coefficient calculator 3122removes the jitter element before using the estimated CIR. Therefore,according to the embodiment of the present invention, each of the firstand second cleaners 3113 and 3115 removes a portion of the estimated CIRhaving a power level lower than the predetermined threshold value (i.e.,so that the estimated CIR becomes equal to ‘0’). Herein, this removalprocess will be referred to as a “CIR cleaning” process.

The CIR interpolator-extrapolator 3114 performs CIR interpolation bymultiplying a CIR estimated from the CIR estimator 3112 by a coefficientand by multiplying a CIR having its phase change compensated from thephase compensator (or maximum likelihood phase compensator) 3112 byanother coefficient, thereby adding the multiplied values. At thispoint, some of the noise elements of the CIR may be added to oneanother, thereby being cancelled. Therefore, when the CIRinterpolator-extrapolator 3114 performs CIR interpolation, the original(or initial) CIR having noise elements remaining therein. In otherwords, when the CIR interpolator-extrapolator 3114 performs CIRinterpolation, an estimated CIR having its phase change compensated bythe phase compensator 3112 bypasses the first cleaner 3113 and isinputted to the CIR interpolator-extrapolator 3114. Subsequently, thesecond cleaner 3115 cleans the CIR interpolated by the CIRinterpolator-extrapolator 3114.

Conversely, the CIR interpolator-extrapolator 3114 performs CIRextrapolation by using a difference value between two CIRs, each havingits phase change compensated by the phase compensator 3112, so as toestimate a CIR positioned outside of the two CIRs. Therefore, in thiscase, the noise element is rather amplified. Accordingly, when the CIRinterpolator-extrapolator 3114 performs CIR extrapolation, the CIRcleaned by the first cleaner 3113 is used. More specifically, when theCIR interpolator-extrapolator 3114 performs CIR extrapolation, theextrapolated CIR passes through the second cleaner 3115, thereby beinginputted to the zero-padding unit 3116.

Meanwhile, when a second frequency domain converter (or fast fouriertransform (FFT2)) 3121 converts the CIR, which has been cleaned andoutputted from the second cleaner 3115, to a frequency domain, thelength and of the inputted CIR and the FFT size may not match (or beidentical to one another). In other words, the CIR length may be smallerthan the FFT size. In this case, the zero-padding unit 3116 adds anumber of zeros ‘0’s corresponding to the difference between the FFTsize and the CIR length to the inputted CIR, thereby outputting theprocessed CIR to the second frequency domain converter (FFT2) 3121.Herein, the zero-padded CIR may correspond to one of the interpolatedCIR, extrapolated CIR, and the CIR estimated in the known data section.

The second frequency domain converter 3121 performs FFT on the CIR beingoutputted from the zero padding unit 3116, thereby converting the CIR toa frequency domain CIR. Then, the second frequency domain converter 3121outputs the converted CIR to the coefficient calculator 3122. Thecoefficient calculator 3122 uses the frequency domain CIR beingoutputted from the second frequency domain converter 3121 to calculatethe equalization coefficient. Then, the coefficient calculator 3122outputs the calculated coefficient to the distortion compensator 3130.Herein, for example, the coefficient calculator 3122 calculates achannel equalization coefficient of the frequency domain that canprovide minimum mean square error (MMSE) from the CIR of the frequencydomain, which is outputted to the distortion compensator 3130. Thedistortion compensator 3130 performs a complex number multiplication onthe overlapped data of the frequency domain being outputted from the FFTunit 3102 of the first frequency domain converter 3100 and theequalization coefficient calculated by the coefficient calculator 3122,thereby compensating the channel distortion of the overlapped data beingoutputted from the FFT unit 3102.

FIG. 53 illustrates a block diagram of a channel equalizer according toanother embodiment of the present invention. In other words, FIG. 53illustrates a block diagram showing another example of a channelequalizer by using different CIR estimation and application methods inaccordance with regions A, B, and C, when the data group is divided intothe structure shown in FIG. 7A and FIG. 8. More specifically, as shownin FIG. 7A, known data that are sufficiently are being periodicallytransmitted in region A. Therefore, an indirect equalizing method usingthe CIR may be used herein. However, in regions B and C, the known dataare neither able to be transmitted at a sufficiently long length norable to be periodically and equally transmitted. Therefore, it isinadequate to estimate the CIR by using the known data. Accordingly, inregions B and C, a direct equalizing method in which an error isobtained from the output of the equalizer, so as to update thecoefficient.

The examples presented in the embodiments of the present invention shownin FIG. 53 include a method of performing indirect channel equalizationby using a cyclic prefix on the data of region A, and a method ofperforming direct channel equalization by using an overlap & save methodon the data of regions B and C. Accordingly, referring to FIG. 53, thefrequency domain channel equalizer includes a frequency domain converter3510, a distortion compensator 3520, a time domain converter 3530, afirst coefficient calculating unit 3540, a second coefficientcalculating unit 3550, and a coefficient selector 3560.

Herein, the frequency domain converter 3510 includes an overlap unit3511, a select unit 3512, and a first FFT unit 3513. The time domainconverter 3530 includes an IFFT unit 3531, a save unit 3532, and aselect unit 3533. The first coefficient calculating unit 3540 includes aCIR estimator 3541, an average calculator 3542, second FFT unit 3543,and a coefficient calculator 3544. The second coefficient calculatingunit 3550 includes a decision unit 3551, a select unit 3552, asubtractor 3553, a zero-padding unit 3554, a third FFT unit 3555, acoefficient updater 3556, and a delay unit 3557. Also, a multiplexer(MUX), which selects data that are currently being inputted as the inputdata depending upon whether the data correspond to region A or toregions B and C, may be used as the select unit 3512 of the frequencydomain converter 3510, the select unit 3533 of the time domain converter3530, and the coefficient selector 3560.

In the channel equalizer having the above-described structure, as shownin FIG. 53, if the data being inputted correspond to the data of regionA, the select unit 3512 of the frequency domain converter 3510 selectsthe input data and not the output data of the overlap unit 3511. In thesame case, the select unit 3533 of the time domain converter 3530selects the output data of the IFFT unit 3531 and not the output data ofthe save unit 3532. The coefficient selector 3560 selects theequalization coefficient being outputted from the first coefficientcalculating unit 3540.

Conversely, if the data being inputted correspond to the data of regionsB and C, the select unit 3512 of the frequency domain converter 3510selects the output data of the overlap unit 3511 and not the input data.In the same case, the select unit 3533 of the time domain converter 3530selects the output data of the save unit 3532 and not the output data ofthe IFFT unit 3531. The coefficient selector 3560 selects theequalization coefficient being outputted from the second coefficientcalculating unit 3550.

More specifically, the received data are inputted to the overlap unit3511 and select unit 3512 of the frequency domain converter 3510, and tothe first coefficient calculating unit 3540. If the inputted datacorrespond to the data of region A, the select unit 3512 selects thereceived data, which are then outputted to the first FFT unit 3513. Onthe other hand, if the inputted data correspond to the data of regions Band C, the select unit 3512 selects the data that are overlapped by theoverlap unit 3513 and are, then, outputted to the first FFT unit 3513.The first FFT unit 3513 performs FFT on the time domain data that areoutputted from the select unit 3512, thereby converting the time domaindata to frequency domain data. Then, the converted data are outputted tothe distortion compensator 3520 and the delay unit 3557 of the secondcoefficient calculating unit 3550.

The distortion compensator 3520 performs complex multiplication onfrequency domain data outputted from the first FFT unit 3513 and theequalization coefficient outputted from the coefficient selector 3560,thereby compensating the channel distortion detected in the data thatare being outputted from the first FFT unit 3513. Thereafter, thedistortion-compensated data are outputted to the IFFT unit 3531 of thetime domain converter 3530. The IFFT unit 3531 of the time domainconverter 3530 performs IFFT on the channel-distortion-compensated data,thereby converting the compensated data to time domain data. Theconverted data are then outputted to the save unit 3532 and the selectunit 3533. If the inputted data correspond to the data of region A, theselect unit 3533 selects the output data of the IFFT unit 3531. On theother hand, if the inputted data correspond to regions B and C, theselect unit 3533 selects the valid data extracted from the save unit3532. Thereafter, the selected data are outputted to be decoded and,simultaneously, outputted to the second coefficient calculating unit3550.

The CIR estimator 3541 of the first coefficient calculating unit 3540uses the data being received during the known data section and the knowndata (reference data generated from the receiving system) of the knowndata section, the known data being pre-known by the receiving system inaccordance with an agreement between the receiving system and thetransmitting system, in order to estimate the CIR. Subsequently, theestimated CIR is outputted to the average calculator 3542. The averagecalculator 3542 calculates an average value of the CIRs that are beinginputted consecutively. Then, the calculated average value is outputtedto the second FFT unit 3543.

The second FFT unit 3543 performs FFT on the CIR of the time domain thatis being inputted, so as to convert the inputted CIR to a frequencydomain CIR. Thereafter, the converted frequency domain CIR is outputtedto the coefficient calculator 3544. The coefficient calculator 3544calculates a frequency domain equalization coefficient that satisfiesthe condition of using the CIR of the frequency domain so as to minimizethe mean square error. The calculated equalizer coefficient of thefrequency domain is then outputted to the coefficient calculator 3560.

The decision unit 3551 of the second coefficient calculating unit 3550selects one of a plurality of decision values (e.g., 8 decision values)that is most approximate to the equalized data and outputs the selecteddecision value to the select unit 3552. Herein, a multiplexer may beused as the select unit 3552. In a general data section, the select unit3552 selects the decision value of the decision unit 3551.Alternatively, in a known data section, the select unit 3552 selects theknown data and outputs the selected known data to the subtractor 3553.The subtractor 3553 subtracts the output of the select unit 3533included in the time domain converter 3530 from the output of the selectunit 3533 so as to calculate (or obtain) an error value. Thereafter, thecalculated error value is outputted to the zero-padding unit 3554.

The zero-padding unit 3554 adds (or inserts) the same amount of zeros(0) corresponding to the overlapped amount of the received data in theinputted error. Then, the error extended with zeros (0) is outputted tothe third FFT unit 3555. The third FFT unit 3555 converts the error ofthe time domain having zeros (0) added (or inserted) therein, to theerror of the frequency domain. Thereafter, the converted error isoutputted to the coefficient update unit 3556. The coefficient updateunit 3556 uses the received data of the frequency domain that have beendelayed by the delay unit 3557 and the error of the frequency domain soas to update the previous equalization coefficient. Thereafter, theupdated equalization coefficient is outputted to the coefficientselector 3560. At this point, the updated equalization coefficient isstored so as that it can be used as a previous equalization coefficientin a later process.

If the input data correspond to the data of region A, the coefficientselector 3560 selects the equalization coefficient calculated from thefirst coefficient calculating unit 3540. On the other hand, if the inputdata correspond to the data of regions B and C, the coefficient selector3560 selects the equalization coefficient updated by the secondcoefficient calculating unit 3550. Thereafter, the selected equalizationcoefficient is outputted to the distortion compensator 3520.

FIG. 54 illustrates a block diagram of a channel equalizer according toanother embodiment of the present invention. In other words, FIG. 54illustrates a block diagram showing another example of a channelequalizer by using different CIR estimation and application methods inaccordance with regions A, B, and C, when the data group is divided intothe structure shown in FIG. 7A. In this example, a method of performingindirect channel equalization by using an overlap & save method on thedata of region A, and a method of performing direct channel equalizationby using an overlap & save method on the data of regions B and C areillustrated.

Accordingly, referring to FIG. 54, the frequency domain channelequalizer includes a frequency domain converter 3610, a distortioncompensator 3620, a time domain converter 3630, a first coefficientcalculating unit 3640, a second coefficient calculating unit 3650, and acoefficient selector 3660. Herein, the frequency domain converter 3610includes an overlap unit 3611 and a first FFT unit 3612. The time domainconverter 3630 includes an IFFT unit 3631 and a save unit 3632. Thefirst coefficient calculating unit 3640 includes a CIR estimator 3641,an interpolator 3642, a second FFT unit 3643, and a coefficientcalculator 3644. The second coefficient calculating unit 3650 includes adecision unit 3651, a select unit 3652, a subtractor 3653, azero-padding unit 3654, a third FFT unit 3655, a coefficient updater3656, and a delay unit 3657.

Also, a multiplexer (MUX), which selects data that are currently beinginputted as the input data depending upon whether the data correspond toregion A or to regions B and C, may be used as the coefficient selector3660. More specifically, if the input data correspond to the data ofregion A, the coefficient selector 3660 selects the equalizationcoefficient calculated from the first coefficient calculating unit 3640.On the other hand, if the input data correspond to the data of regions Band C, the coefficient selector 3660 selects the equalizationcoefficient updated by the second coefficient calculating unit 3650.

In the channel equalizer having the above-described structure, as shownin FIG. 54, the received data are inputted to the overlap unit 3611 ofthe frequency domain converter 3610 and to the first coefficientcalculating unit 3640. The overlap unit 3611 overlaps the input data toa pre-determined overlapping ratio and outputs the overlapped data tothe first FFT unit 3612. The first FFT unit 3612 performs FFT on theoverlapped time domain data, thereby converting the overlapped timedomain data to overlapped frequency domain data. Then, the converteddata are outputted to the distortion compensator 3620 and the delay unit3657 of the second coefficient calculating unit 3650.

The distortion compensator 3620 performs complex multiplication on theoverlapped frequency domain data outputted from the first FFT unit 3612and the equalization coefficient outputted from the coefficient selector3660, thereby compensating the channel distortion detected in theoverlapped data that are being outputted from the first FFT unit 3612.Thereafter, the distortion-compensated data are outputted to the IFFTunit 3631 of the time domain converter 3630. The IFFT unit 3631 of thetime domain converter 3630 performs IFFT on the distortion-compensateddata, thereby converting the compensated data to overlapped time domaindata. The converted overlapped data are then outputted to the save unit3632. The save unit 3632 extracts only the valid data from theoverlapped time domain data, which are then outputted for data decodingand, at the same time, outputted to the second coefficient calculatingunit 3650 in order to update the coefficient.

The CIR estimator 3641 of the first coefficient calculating unit 3640uses the data received during the known data section and the known datain order to estimate the CIR. Subsequently, the estimated CIR isoutputted to the interpolator 3642. Furthermore, the CIR estimator 3641uses the data received during the field synchronization section andreference field synchronization data generated from the receivingsystem, so as to estimate the CIR. Thereafter, the estimated CIR isoutputted the interpolator 3642. The interpolator 3642 uses the inputtedCIR to estimate the CIRs (i.e., CIRs of the region that does not includethe known data) corresponding to the points located between theestimated CIRs according to a predetermined interpolation method.Thereafter, the estimated result is outputted to the second FFT unit3643.

The second FFT unit 3643 performs FFT on the inputted CIR, so as toconvert the inputted CIR to a frequency domain CIR. Thereafter, theconverted frequency domain CIR is outputted to the coefficientcalculator 3644. The coefficient calculator 3644 calculates a frequencydomain equalization coefficient that satisfies the condition of usingthe CIR of the frequency domain so as to minimize the mean square error.The calculated equalizer coefficient of the frequency domain is thenoutputted to the coefficient calculator 3660. The structure andoperations of the second coefficient calculating unit 3650 is identicalto those of the second coefficient calculating unit 3550 shown in FIG.53. Therefore, the description of the same will be omitted forsimplicity.

If the input data correspond to the data of region A, the coefficientselector 3660 selects the equalization coefficient calculated from thefirst coefficient calculating unit 3640. On the other hand, if the inputdata correspond to the data of regions B and C, the coefficient selector3660 selects the equalization coefficient updated by the secondcoefficient calculating unit 3650. Thereafter, the selected equalizationcoefficient is outputted to the distortion compensator 3620.

FIG. 55 illustrates a block diagram of a channel equalizer according toanother embodiment of the present invention. In other words, FIG. 55illustrates a block diagram showing another example of a channelequalizer by using different CIR estimation and application methods inaccordance with regions A, B, and C, when the data group is divided intothe structure shown in FIG. 7A. For example, in region A, the presentinvention uses the known data in order to estimate the CIR by using aleast square (LS) method, thereby performing the channel equalizationprocess. On the other hand, in regions B and C, the present inventionestimates the CIR by using a least mean square (LMS) method, therebyperforming the channel equalization process. More specifically, sincethe periodic known data do not exist in regions B and C, as in region A,the same channel equalization process as that of region A cannot beperformed in regions B and C. Therefore, the channel equalizationprocess may only be performed by using the LMS method.

Referring to FIG. 55, the channel equalizer includes an overlap unit3701, a first fast fourier transform (FFT) unit 3702, a distortioncompensator 3703, an inverse fast fourier transform (IFFT) unit 3704, asave unit 3705, a first CIR estimator 3706, a CIR interpolator 3707, adecision unit 3708, a second CIR estimator 3710, a selection unit 3711,a second FFT unit 3712, and a coefficient calculator 3713. Herein, anydevice performed complex number multiplication may be used as thedistortion compensator 3703. In the channel equalizer having theabove-described structure, as shown in FIG. 55, the overlap unit 3701overlaps the data being inputted to the channel equalizer to apredetermined overlapping ratio and then outputs the overlapped data tothe first FFT unit 3702. The first FFT unit 3702 converts (ortransforms) the overlapped data of the time domain to overlapped data ofthe frequency domain by using fast fourier transform (FFT). Then, theconverted data are outputted to the distortion compensator 3703.

The distortion compensator 3703 performs complex multiplication on theequalization coefficient calculated from the coefficient calculator 3713and the overlapped data of the frequency domain, thereby compensatingthe channel distortion of the overlapped data being outputted from thefirst FFT unit 3702. Thereafter, the distortion-compensated data areoutputted to the IFFT unit 3704. The IFFT unit 3704 performs inversefast fourier transform (IFFT) on the distortion-compensated overlappeddata, so as to convert the corresponding data back to data (i.e.,overlapped data) of the time domain. Subsequently, the converted dataare outputted to the save unit 3705. The save unit 3705 extracts onlythe valid data from the overlapped data of the time domain. Then, thesave unit 3705 outputs the extracted valid data for a data decodingprocess and, at the same time, outputs the extracted valid data to thedecision unit 3708 for a channel estimation process.

The decision unit 3708 selects one of a plurality of decision values(e.g., 8 decision values) that is most approximate to the equalized dataand outputs the selected decision value to the select unit 3709. Herein,a multiplexer may be used as the select unit 3709. In a general datasection, the select unit 3709 selects the decision value of the decisionunit 3708. Alternatively, in a known data section, the select unit 3709selects the known data and outputs the selected known data to the secondCIR estimator 3710.

Meanwhile, the first CIR estimator 3706 uses the data that are beinginputted in the known data section and the known data so as to estimatethe CIR. Thereafter, the first CIR estimator 3706 outputs the estimatedCIR to the CIR interpolator 3707. Herein, the known data correspond toreference known data created during the known data section by thereceiving system in accordance with an agreement between thetransmitting system and the receiving system. Also, the first CIRestimator 3706 uses the data being inputted during the fieldsynchronization section and the reference field synchronization data, soas to estimate the CIR. Then, the first CIR estimator 3706 outputs theestimated CIR to the CIR interpolator 3707. Herein, the reference fieldsynchronization data correspond to reference field synchronization datagenerated by the receiving system based upon an agreement between thetransmitting system and the receiving system.

At this point, according to an embodiment of the present invention, thefirst CIR estimator 3706 uses the LS method to estimate the CIR. The LSestimation method calculates a cross correlation value p between theknown data that have passed through the channel during the known datasection and the known data that are already known by the receiving end.Then, a cross correlation matrix R of the known data is calculated.Subsequently, a matrix operation is performed on R⁻¹·p so that the crosscorrelation portion within the cross correlation value p between thereceived data and the initial known data, thereby estimating the CIR ofthe transmission channel.

The CIR interpolator 3707 receives the CIR from the first CIR estimator3706. And, in the section between two sets of known data, the CIR isinterpolated in accordance with a pre-determined interpolation method.Then, the interpolated CIR is outputted. At this point, thepre-determined interpolation method corresponds to a method ofestimating a particular set of data at an unknown point by using a setof data known by a particular function. For example, such methodincludes a linear interpolation method. The linear interpolation methodis one of the most simple interpolation methods. A variety of otherinterpolation methods may be used instead of the above-described linearinterpolation method. It is apparent that the present invention is notlimited only to the example set forth in the description of the presentinvention. More specifically, the CIR interpolator 3707 uses the CIRthat is being inputted in order to estimate the CIR of the section thatdoes not include any known data by using the pre-determinedinterpolation method. Thereafter, the estimated CIR is outputted to theselect unit 3711.

The second CIR estimator 3710 uses the input data of the channelequalizer and the output data of the select unit 3709 in order toestimate the CIR. Then, the second CIR estimator 3710 outputs theestimated CIR to the select unit 3711. At this point, according to anembodiment of the present invention, the CIR is estimated by using theLMS method. The LMS estimation method will be described in detail in alater process. In region A, the select unit 3711 selects the CIRoutputted from the CIR interpolator 3707. And, in regions B and C, theselect unit 3711 selects the CIR outputted from the second CIR estimator3710. Thereafter, the select unit 3711 outputs the selected CIR to thesecond FFT unit 3712.

The second FFT unit 3712 converts the CIR that is being inputted to aCIR of the frequency domain, which is then outputted to the coefficientcalculator 3713. The coefficient calculator 3713 uses the CIR of thefrequency domain that is being inputted, so as to calculate theequalization coefficient and to output the calculated equalizationcoefficient to the distortion compensator 3703. At this point, thecoefficient calculator 3713 calculates a channel equalizationcoefficient of the frequency domain that can provide minimum mean squareerror (MMSE) from the CIR of the frequency domain. Herein, the secondCIR estimator 3710 may use the CIR estimated in region A as an initialCIR of regions B and C. For example, the value of the last CIR of regionA may be used as the value of the initial CIR of region C. Accordingly,the convergence speed of regions B and C may be reduced.

The basic principle of estimating the CIR by using the LMS method in thesecond CIR estimator 3710 corresponds to receiving the output of anunknown transmission channel and to updating (or renewing) thecoefficient of an adaptive filter (not shown) so that the differencevalue between the output value of the unknown channel and the outputvalue of the adaptive filter is minimized. More specifically, thecoefficient value of the adaptive filter is renewed so that the inputdata of the channel equalizer is equal to the output value of theadaptive filter (not shown) included in the second CIR estimator 3710.Thereafter, the filter coefficient is outputted as the CIR after eachFFT cycle.

Referring to FIG. 56, the second CIR estimator 3710 includes a delayunit T, a multiplier, and a coefficient renewal unit for each tab.Herein, the delay unit T sequentially delays the output data {circumflexover (x)}(n) of the select unit 3709. The multiplier multipliesrespective output data outputted from each delay unit T with error datae(n). The coefficient renewal unit renews the coefficient by using theoutput corresponding to each multiplier. Herein, the multipliers thatare being provided as many as the number of tabs will be referred to asa first multiplying unit for simplicity. Furthermore, the second CIRestimator 3710 further includes a plurality of multipliers eachmultiplying the output data of the select unit 3709 and the output dataof the delay unit T (wherein the output data of the last delay unit areexcluded) with the output data corresponding to each respectivecoefficient renewal unit. These multipliers are also provided as many asthe number of tabs. This group of multipliers will be referred to as asecond multiplying unit for simplicity.

The second CIR estimator 3710 further includes an adder and asubtractor. Herein, the adder adds all of the data outputted from eachmultipliers included in the second multiplying unit. Then, the addedvalue is outputted as the estimation value ŷ(n) of the data inputted tothe channel equalizer. The subtractor calculates the difference betweenthe output data ŷ(n) of the adder and the input data y(n) of the channelequalizer. Thereafter, the calculated difference value is outputted asthe error data e(n).

Referring to FIG. 56, in a general data section, the decision value ofthe equalized data is inputted to the first delay unit included in thesecond CIR estimator 3710 and to the first multiplier included in thesecond multiplying unit. In the known data section, the known data areinputted to the first delay unit included in the second CIR estimator3710 and to the first multiplier included in the second multiplyingunit. The input data {circumflex over (x)}(n) are sequentially delayedby passing through a number of serially connected delay units T, thenumber corresponding to the number of tabs. The output data of eachdelay unit T and the error data e(n) are multiplied by eachcorresponding multiplier included in the first multiplying unit.Thereafter, the coefficients are renewed by each respective coefficientrenewal unit.

Each coefficient that is renewed by the corresponding coefficientrenewal unit is multiplied with the input data the output data{circumflex over (x)}(n) and also with the output data of each delayunit T with the exception of the last delay in the correspondingmultiplier of the second multiplying unit. Thereafter, the multipliedvalue is inputted to the adder. The adder then adds all of the outputdata outputted from each multiplier of the second multiplying unit andoutputs the added value to the subtractor as the estimation value ŷ(n)of the input data of the channel equalizer. The subtractor calculates adifference value between the estimation value ŷ(n) and the input datay(n) of the channel equalizer. The difference value is then outputted toeach multiplier of the first multiplying unit as the error data e(n). Atthis point, the error data e(n) is outputted to each multiplier of thefirst multiplying unit by passing through each respective delay unit T.As described above, the coefficient of the adaptive filter iscontinuously renewed. And, the output of each coefficient renewal unitis outputted as the CIR of the second CIR estimator 3710 after each FFTcycle.

The above-described methods for calculating the CIR for channelequalization in each region within the data group are merely examplesgiven to facilitate the understanding of the present invention. And,such methods may be more broadly applied. Therefore, the presentinvention will not be limited only to the examples described herein.

Block Decoder within Receiving System

Meanwhile, if the data being inputted to the block decoder 1005, afterbeing channel-equalized by the equalizer 1003, correspond to the datahaving both block encoding and trellis encoding performed thereon (i.e.,the data within the RS frame, the signaling information data, etc.) bythe transmitting system, trellis decoding and block decoding processesare performed on the inputted data as inverse processes of thetransmitting system. Alternatively, if the data being inputted to theblock decoder 1005 correspond to the data having only trellis encodingperformed thereon (i.e., the main service data), and not the blockencoding, only the trellis decoding process is performed on the inputteddata as the inverse process of the transmitting system.

The trellis decoded and block decoded data by the block decoder 1005 arethen outputted to the RS frame decoder 1006. More specifically, theblock decoder 1005 removes the known data, data used for trellisinitialization, and signaling information data, MPEG header, which havebeen inserted in the data group, and the RS parity data, which have beenadded by the RS encoder/non-systematic RS encoder or non-systematic RSencoder of the transmitting system. Then, the block decoder 1005 outputsthe processed data to the RS frame decoder 1006. Herein, the removal ofthe data may be performed before the block decoding process, or may beperformed during or after the block decoding process. If thetransmitting system includes and transmits signaling information in thedata group, the signaling information is outputted to the datadeformatter 1006.

Meanwhile, the data trellis-decoded by the block decoder 1005 areoutputted to the data deinterleaver 1009. At this point, the data beingtrellis-decoded by the block decoder 1005 and outputted to the datadeinterleaver 1009 may not only include the main service data but mayalso include the data within the RS frame and the signaling information.Furthermore, the RS parity data that are added by the transmittingsystem after the pre-processor 230 may also be included in the databeing outputted to the data deinterleaver 1009.

According to another embodiment of the present invention, data that arenot processed with block decoding and only processed with trellisencoding by the transmitting system may directly bypass the blockdecoder 1005 so as to be outputted to the data deinterleaver 1009. Inthis case, a trellis decoder should be provided before the datadeinterleaver 1009. More specifically, if the inputted data correspondto the data having only trellis encoding performed thereon and not blockencoding, the block decoder 1005 performs Viterbi (or trellis) decodingon the inputted data so as to output a hard decision value or to performa hard-decision on a soft decision value, thereby outputting the result.Meanwhile, if the inputted data correspond to the data having both blockencoding process and trellis encoding process performed thereon, theblock decoder 1005 outputs a soft decision value with respect to theinputted data.

In other words, if the inputted data correspond to data being processedwith block encoding by the block processor 302 and being processed withtrellis encoding by the trellis encoding module 256, in the transmittingsystem, the block decoder 1005 performs a decoding process and a trellisdecoding process on the inputted data as inverse processes of thetransmitting system. At this point, the RS frame encoder of thepre-processor included in the transmitting system may be viewed as anouter (or external) encoder. And, the trellis encoder may be viewed asan inner (or internal) encoder. When decoding such concatenated codes,in order to allow the block decoder 1005 to maximize its performance ofdecoding externally encoded data, the decoder of the internal codeshould output a soft decision value.

FIG. 57 illustrates a detailed block view of the block decoder 1005according to an embodiment of the present invention. Referring to FIG.57, the block decoder 1005 includes a feedback controller 4010, an inputbuffer 4011, a trellis decoding unit (or 12-way trellis coded modulation(TCM) decoder or inner decoder) 4012, a symbol-byte converter 4013, anouter block extractor 4014, a feedback deformatter 4015, a symboldeinterleaver 4016, an outer symbol mapper 4017, a symbol decoder 4018,an inner symbol mapper 4019, a symbol interleaver 4020, a feedbackformatter 4021, and an output buffer 4022. Herein, just as in thetransmitting system, the trellis decoding unit 4012 may be viewed as aninner (or internal) decoder. And, the symbol decoder 4018 may be viewedas an outer (or external) decoder.

The input buffer 4011 temporarily stores the mobile service data symbolsbeing channel-equalized and outputted from the equalizer 1003. (Herein,the mobile service data symbols may include symbols corresponding to thesignaling information, RS parity data symbols and CRC data symbols addedduring the encoding process of the RS frame.) Thereafter, the inputbuffer 4011 repeatedly outputs the stored symbols for M number of timesto the trellis decoding unit 4012 in a turbo block (TBL) size requiredfor the turbo decoding process. Herein, the size of the input buffer4011 is larger than or equal to the size of the turbo block (TBL)required for turbo decoding. The turbo block (TBL) size is larger thanor equal to the block length (BK) of the symbol interleaver within theblock processor. If symbol values that have not been encoded exist amongthe block encoded symbol values, the input buffer 4011 may equally storeand output such non-encoded symbol values for simplicity of the presentinvention.

At this point, the input data should include a number of symbols beinginputted to the symbol interleaver, wherein the number of symbols isequivalent to the block length (K). Therefore, in this case, the lengthof the TBL is larger than or equal to BK. Also, M represents a number ofrepetitions of the turbo decoding process, the number beingpredetermined by the feedback controller 4010. More specifically, theinput buffer 4011 stores mobile service data symbols corresponding tothe block size TBL for the block decoding process. Herein, the mobileservice data symbols corresponding to the block size TBL required forthe block decoding process are repeatedly outputted to the trellisdecoding unit 4012 as many times as the number of cycle periods duringthe turbo decoding process.

Furthermore, if a symbol being channel-equalized and outputted from theequalizer 1003 does not correspond to a mobile service data symbol(wherein the mobile service data symbol includes symbols correspondingto the signaling information, RS parity data symbols that are addedduring the encoding process of the RS frame, and CRC data symbols), theinput buffer 4011 does not store nor repeatedly output the correspondingsymbol and directly outputs the symbol to the trellis decoding unit 4012without modification. More specifically, since only trellis decoding isperformed on the input symbol value of the section that is not processedwith repetitive turbo decoded, the input buffer 4011 directly output itsinput data to the trellis decoding unit 4012 without storing orrepeatedly outputting the corresponding data. Herein, the storage,repetition, and output of the input buffer 4011 are controlled by thefeedback controller 4010.

The trellis decoding unit 4012 includes a 12-way trellis encoder, shownin FIG. 22, and a 12-way TCM decoder. Herein, the trellis decoding unit4012 performs 12-way trellis decoding as inverse processes of the 12-waytrellis encoder. More specifically, the trellis decoding unit 4012receives a number of output symbols of the input buffer 4011 andsoft-decision values of the feedback formatter 4021 equivalent to eachTBL, so as to perform the TCM decoding process. At this point, basedupon the control of the feedback controller 4010, the soft-decisionvalues outputted from the feedback formatter 4021 are matched with anumber of mobile service data symbol places so as to be in a one-to-one(1:1) correspondence. Herein, the number of mobile service data symbolplaces is equivalent to the TBL being outputted from the input buffer4011.

More specifically, the mobile service data being outputted from theinput buffer 4011 are matched with the turbo decoded data beinginputted, so that each respective data place can correspond with oneanother. Thereafter, the matched data are outputted to the trellisdecoding unit 4012. For example, if the turbo decoded data correspond tothe third symbol within the turbo block, the corresponding symbol (ordata) is matched with the third symbol included in the turbo block,which is outputted from the input buffer 4011. Subsequently, the matchedsymbol (or data) is outputted to the trellis decoding unit 4012.

In order to do so, while the regressive turbo decoding is in process,the feedback controller 4010 controls the input buffer 4011 so that theinput buffer 4011 stores the corresponding turbo block data. Also, bydelaying data (or symbols), the soft decision value (e.g., LLR) of thesymbol outputted from the symbol interleaver 4020 and the symbol of theinput buffer 4011 corresponding to the same place (or position) withinthe block of the output symbol are matched with one another to be in aone-to-one correspondence. Thereafter, the matched symbols arecontrolled so that they can be inputted to the TCM decoder through therespective path. At this point, if a symbol is not block encoded, turbodecoding cannot be performed, and so a null value is inputted by thefeedback formatter 4021 to the matched output position (or place). Thisprocess is repeated for a predetermined number of turbo decoding cycleperiods. Then, the data of the next turbo block are outputted from theinput buffer 4011, thereby repeating the turbo decoding process.

The output of the trellis decoding unit 4012 signifies a degree ofreliability of the transmission bits configuring each symbol. Forexample, in the transmitting system, since the input data of the trellisencoding module correspond to two bits as one symbol, a log likelihoodratio (LLR) between the likelihood of a bit having the value of ‘1’ andthe likelihood of the bit having the value of ‘0’ may be respectivelyoutputted (in bit units) to the upper bit and the lower bit. Herein, thelog likelihood ratio corresponds to a log value for the ratio betweenthe likelihood of a bit having the value of ‘1’ and the likelihood ofthe bit having the value of ‘0’. Alternatively, a LLR for the likelihoodof 2 bits (i.e., one symbol) being equal to “00”, “01”, “10”, and “11”may be respectively outputted (in symbol units) to all 4 combinations ofbits (i.e., 00, 01, 10, 11). Consequently, this becomes the softdecision value that indicates the degree of reliability of thetransmission bits configuring each symbol. A maximum a posterioriprobability (MAP) or a soft-out Viterbi algorithm (SOVA) may be used asa decoding algorithm of each TCM decoder within the trellis decodingunit 4012.

The output of the trellis decoding unit 4012 is inputted to thesymbol-byte converter 4013 and the outer block extractor 4014. Thesymbol-byte converter 4013 performs a hard-decision process of the softdecision value that is trellis decoded and outputted from the trellisdecoding unit 4012. Thereafter, the symbol-byte converter 4013 groups 4symbols into byte units, which are then outputted to the datadeinterleaver 1009. More specifically, the symbol-byte converter 4013performs hard-decision in bit units on the soft decision value of thesymbol outputted from the trellis decoding unit 4012. Therefore, thedata processed with hard-decision and outputted in bit units from thesymbol-byte converter 4013 not only include main service data, but mayalso include mobile service data, known data, RS parity data, and MPEGheaders.

Among the soft decision values of the trellis decoding unit 4012, theouter block extractor 4014 identifies the soft decision valuescorresponding to the mobile service data symbols (wherein symbolscorresponding to signaling information, RS parity data symbols that areadded during the encoding of the RS frame, and CRC data symbols areincluded) and outputs the identified soft decision values to thefeedback deformatter 4015. The feedback deformatter 4015 changes theprocessing order of the soft decision values corresponding to the mobileservice data symbols. This is an inverse process of an initial change inthe processing order of the mobile service data symbols, which aregenerated during an intermediate step, wherein the output symbolsoutputted from the block processor 303 of the transmitting system arebeing inputted to the trellis encoding module (e.g., when the symbolspass through the group formatter, the data deinterleaver, the packetformatter, the RS encoder, and the data interleaver). Thereafter, thefeedback deformatter 4015 outputs the processed mobile service datasymbols to the symbol deinterleaver 4016.

The symbol deinterleaver 4016 performs deinterleaving on the mobileservice data symbols having their processing orders changed andoutputted from the feedback deformatter 4015, as an inverse process ofthe symbol interleaving process of the symbol interleaver 403 includedin the transmitting system. The size of the block used by the symboldeinterleaver 4016 during the deinterleaving process is identical tointerleaving size of an actual symbol (i.e., BK) of the symbolinterleaver, shown in FIG. 19, which is included in the transmittingsystem. This is because the turbo decoding process is performed betweenthe trellis decoding unit 4012 and the symbol decoder 4018. Both theinput and output of the symbol deinterleaver 4016 correspond to softdecision values, and the deinterleaved soft decision values areoutputted to the outer symbol mapper 4017.

The operations of the outer symbol mapper 4017 may vary depending uponthe structure and coding rate of the symbol encoder 402 included in thetransmitting system. For example, when data are ½-rate encoded by thesymbol encoder 402 and then transmitted, the outer symbol mapper 4017directly outputs the input data without modification. In anotherexample, when data are ¼-rate encoded by the symbol encoder 402 and thentransmitted, the outer symbol mapper 4017 converts the input data sothat it can match the input data format of the symbol decoder 4018.Then, the outer symbol mapper 4017 outputs the converted data to thesymbol decoder 4018.

The symbol decoder 4018 (i.e., the outer decoder) receives the dataoutputted from the outer symbol mapper 4017 and performs symbol decodingas an inverse process of the symbol encoder 402 included in thetransmitting system. At this point, two different soft decision valuesare outputted from the symbol decoder 4018. One of the outputted softdecision values corresponds to a soft decision value matching the outputsymbol of the symbol encoder 402 (hereinafter referred to as a “firstsoft decision value”). The other one of the outputted soft decisionvalues corresponds to a soft decision value matching the input bit ofthe symbol encoder 402 (hereinafter referred to as a “second softdecision value”).

More specifically, the first soft decision value represents a degree ofreliability the output symbol (i.e., 2 bits) of the symbol encoder 402.Herein, the first soft decision value may output (in bit units) a LLRbetween the likelihood of 1 bit being equal to ‘1’ and the likelihood of1 bit being equal to ‘0’ with respect to each of the upper bit and lowerbit, which configures a symbol. Alternatively, the first soft decisionvalue may also output (in symbol units) a LLR for the likelihood of 2bits being equal to “00”, “01”, “10”, and “11” with respect to allpossible combinations. The first soft decision value is fed-back to thetrellis decoding unit 4012 through the inner symbol mapper 4019, thesymbol interleaver 4020, and the feedback formatter 4021. On the otherhand, the second soft decision value indicates a degree of reliabilitythe input bit of the symbol encoder 402 included in the transmittingsystem. Herein, the second soft decision value is represented as the LLRbetween the likelihood of 1 bit being equal to ‘1’ and the likelihood of1 bit being equal to ‘0’. Thereafter, the second soft decision value isoutputted to the outer buffer 4022. In this case, a maximum a posterioriprobability (MAP) or a soft-out Viterbi algorithm (SOVA) may be used asthe decoding algorithm of the symbol decoder 4018.

The first soft decision value that is outputted from the symbol decoder4018 is inputted to the inner symbol mapper 4019. The inner symbolmapper 4019 converts the first soft decision value to a data formatcorresponding the input data of the trellis decoding unit 4012.Thereafter, the inner symbol mapper 4019 outputs the converted softdecision value to the symbol interleaver 4020. The operations of theinner symbol mapper 4019 may also vary depending upon the structure andcoding rate of the symbol encoder 402 included in the transmittingsystem.

Hereinafter, when the symbol encoder 402 of the transmitting systemoperates as a ¼ encoder, the operations of the outer symbol mapper 4017and the inner symbol mapper 4019 will now be described in detail withreference to FIG. 17A to FIG. 17C. According to an embodiment of thepresent invention, it is assumed that the symbol encoder is configuredas shown in FIG. 17A, and that the ¼ outer encoder 411 encodes one bit Uso as to output 4 bits u0, u1, u2, and u3, and also that the 4 bits(i.e., 2 symbols) are transmitted twice in symbol units (i.e., each ofthe 2 symbols is transmitted twice) through the parallel/serialconverter 412. In this case, the symbol that is outputted first isreferred to as an odd-number-designated symbol, and the symbol that isoutputted subsequently is referred to as an even-number-designatedsymbol for simplicity.

At this point, when the input/output units of the outer symbol mapper4017 and the inner symbol mapper 4019 corresponds to symbol units, 16(i.e., 2⁴=16) different soft decision values may be outputted in symbolunits from the outer symbol mapper 4017. For example, among the 16(i.e., 2⁴=16) different soft decision values that are to be outputtedfrom the outer symbol mapper 4017, the soft decision value of s=(1, 0,0, 1) may be calculated by adding the soft decision value of theinputted odd-number-designated symbol m₀=(1, 0) and the soft decisionvalue of the inputted even-number-designated symbol m₁=(0, 1).Afterwards, the added value is inputted to the symbol decoder 4018.

Furthermore, a total of 4 (i.e., 2²=4) different soft decision valuesmay be outputted in symbol units from the inner symbol mapper 4019. Forexample, among the 4 (i.e., 2²=4) different soft decision values thatare to be outputted from the inner symbol mapper 4019, the soft decisionvalue of the odd-number-designated symbol m₀=(1, 1) may be obtained bycalculating the largest value among the soft decision value for each ofthe output symbols s=(1, 1, X, X) outputted from the symbol decoder4018. Afterwards, the added value is inputted to the symbol decoder4018. Also, the soft decision value of the even-number-designated symbolm₁=(0, 0) may be obtained by calculating the largest value among thesoft decision value for each of the output symbols s=(X, X, 0, 0)outputted from the symbol decoder 4018. Herein, ‘X’ randomly correspondsto one of ‘1’ and ‘0’. The output of the inner symbol mapper 4019 isthen provided to the symbol interleaver 4020.

Meanwhile, if the input/output units of the outer symbol mapper 4017 andthe inner symbol mapper 4019 correspond to bit units, a total of 4different soft decision values may be outputted in bit units from theouter symbol mapper 4017. More specifically, the outer symbol mapper4017 simultaneously outputs 2 soft decision values of anodd-number-designated input symbol (i.e., a soft decision value for eachof the upper bit and lower bit configuring the odd-number-designatedinput symbol) and 2 soft decision values of an even-number-designatedinput symbol (i.e., a soft decision value for each of the upper bit andlower bit configuring the even-number-designated input symbol) to thesymbol decoder 4018. Also, with respect to the 4 inputs provided by thesymbol decoder 4018, the inner symbol mapper 4019 also identifies 2 softdecision values of an odd-number-designated output symbol (i.e., a softdecision value for each of the upper bit and lower bit configuring theodd-number-designated output symbol of the symbol decoder 4018) and 2soft decision values of an even-number-designated output symbol (i.e., asoft decision value for each of the upper bit and lower bit configuringthe even-number-designated output symbol of the symbol decoder 4018),which are then outputted to the symbol interleaver 4020.

In other words, if the symbol encoding process is performed as shown inFIG. 17A, the LLR for each of the 16 symbols is respectively receivedand symbol-decoded. Thereafter, the processed LLR for each of the 16symbols may be outputted as the first soft decision value.Alternatively, the LLR for each of the 4 symbols is respectivelyreceived and symbol-decoded. Thereafter, the processed LLR for each ofthe 4 symbols may be outputted as the first soft decision value.

According to another embodiment of the present invention, it is assumedthat the symbol encoder is configured as shown in FIG. 17B, and that the½ outer encoder 421 encodes one bit U so as to output 2 bits u0 and u1,and also that the 2 bits (i.e., 1 symbol) is repeated once through therepeater 422. In this case, the symbol that is outputted first isreferred to as an odd-number-designated symbol, and the symbol that isoutputted subsequently is referred to as an even-number-designatedsymbol for simplicity.

At this point, when the input/output units of the outer symbol mapper4017 and the inner symbol mapper 4019 corresponds to symbol units, 4(i.e., 2²=4) different soft decision values may be outputted in symbolunits from the outer symbol mapper 4017. For example, among the 4 (i.e.,2²=4) different soft decision values that are to be outputted in symbolunits from the outer symbol mapper 4017, the soft decision value ofs=(1, 0) may be calculated by adding the soft decision value of theinputted odd-number-designated symbol m₀=(1, 0) and the soft decisionvalue of the inputted even-number-designated symbol m₁=(1, 0).Afterwards, the added value is provided to the symbol decoder 4018.Furthermore, a total of 4 (i.e., 2²=4) different soft decision values isto be outputted from the inner symbol mapper 4019. For example, amongthe 4 (i.e., 2²=4) different soft decision values, the soft decisionvalue of the odd-number-designated symbol m₀=(1, 1) and theeven-number-designated symbol m₁=(1, 1) become the soft decision valueof the input symbol s=(1, 1) of the symbol decoder 4018. This softdecision value is then outputted to the symbol interleaver 4020.

Meanwhile, if the input/output units of the outer symbol mapper 4017 andthe inner symbol mapper 4019 correspond to bit units, a total of 2 softdecision values (i.e., a soft decision for the upper bit and a softdecision value for the lower bit) may be outputted in bit units from theouter symbol mapper 4017. Herein, the soft decision value for the upperbit may be obtained by adding the soft decision for the upper bit of theodd-number-designated symbol and the soft decision for the upper bit ofthe even-number-designated symbol. Also, the soft decision value for thelower bit may be obtained by adding the soft decision for the lower bitof the odd-number-designated symbol and the soft decision for the lowerbit of the even-number-designated symbol.

The inner symbol mapper 4019 receives the soft decision value for theupper bit and the soft decision value for the lower bit from the symboldecoder 4018. Thereafter, the inner symbol mapper 4019 outputs thereceived soft decision values as 2 soft decision values corresponding toeach of the odd-number-designated output bits (i.e., a soft decisionvalue for each of the lower bit and upper bit that are outputted fromthe symbol decoder 4018). Then, the 2 soft decision values correspondingto each of the odd-number-designated output bits are repeated, therebybeing outputted as 2 soft decision values corresponding to each of theeven-number-designated output bits.

According to yet another embodiment of the present invention, it isassumed that the symbol encoder is configured as shown in FIG. 17C, andthat the input bit is repeated once by the repeater 431, and that the ½outer encoder 432 ½-rate encodes the bit that is repeated and inputtedfrom the repeater 431, so as to output 2 bits u0 and u1 (i.e., 1 symbol)twice. In this case, the symbol encoder repeats one bit and encodes therepeated bit at a coding rate of ½. Herein, the symbol that is outputtedfirst is referred to as an odd-number-designated symbol, and the symbolthat is outputted subsequently is referred to as aneven-number-designated symbol for simplicity.

At this point, if the input/output units of the outer symbol mapper 4017and the inner symbol mapper 4019 correspond to bit units, the outersymbol mapper 4017 directly transmits the output of the symboldeinterleaver 4016 to the symbol decoder 4018 without modification. Theinner symbol mapper 4019 directly transmits the output of the symboldecoder 4018 to the symbol interleaver 4020 without modification. Also,even when the input/output units of the outer symbol mapper 4017 and theinner symbol mapper 4019 correspond to symbol units, the outer symbolmapper 4017 directly transmits the output of the symbol deinterleaver4016 to the symbol decoder 4018 without modification. The inner symbolmapper 4019 directly transmits the output of the symbol decoder 4018 tothe symbol interleaver 4020 without modification.

Referring to FIG. 17C, since the input of the ½ outer encoder 432 isrepeated by the repeater 431, the soft decisions values for the 2symbols corresponding to the output data of the block decoder should bedetermined and outputted as a single soft decision value. Morespecifically, when the symbol encoding is processed as shown in FIG. 17Band FIG. 17C, the LLR for each of the 4 different symbols may bereceived and symbol-decoded. Thereafter, the LLR for each of the 4symbols may be outputted as the first soft decision value.Alternatively, the LLR for 2 bits may be received and symbol-decoded.Thereafter, the LLR for the 2 bits may be outputted as the first softdecision value.

The symbol interleaver 4020 performs symbol interleaving, as shown inFIG. 19, on the first soft decision value that is outputted from theinner symbol mapper 4019. Then, the symbol interleaver 4020 outputs thesymbol-interleaved first soft decision value to the feedback formatter4021. Herein, the output of the symbol interleaver 4020 also correspondsto a soft decision value. With respect to the changed processing orderof the soft decision values corresponding to the symbols that aregenerated during an intermediate step, wherein the output symbolsoutputted from the block processor 303 of the transmitting system arebeing inputted to the trellis encoding module 256 (e.g., when thesymbols pass through the group formatter, the data deinterleaver, thepacket formatter, the RS encoder, and the data interleaver), thefeedback formatter 4021 alters (or changes) the order of the outputvalues outputted from the symbol interleaver 4020. Subsequently, thesymbol formatter 4020 outputs values to the trellis decoding unit 4012in the changed order.

The soft decision values outputted from the symbol interleaver 4020 arematched with the positions of mobile service data symbols each havingthe size of TBL, which are outputted from the input buffer 4011, so asto be in a one-to-one correspondence. Thereafter, the soft decisionvalues matched with the respective symbol position are inputted to thetrellis decoding unit 4012. At this point, since the main service datasymbols or the RS parity data symbols and known data symbols of the mainservice data do not correspond to the mobile service data symbols, thefeedback formatter 4021 inserts null data in the correspondingpositions, thereby outputting the processed data to the trellis decodingunit 4012. Additionally, each time the symbols having the size of TBLare turbo decoded, no value is fed-back by the symbol interleaver 4020starting from the beginning of the first decoding process. Therefore,the feedback formatter 4021 is controlled by the feedback controller4010, thereby inserting null data into all symbol positions including amobile service data symbol. Then, the processed data are outputted tothe trellis decoding unit 4012.

The output buffer 4022 receives the second soft decision value from thesymbol decoder 4018 based upon the control of the feedback controller4010. Then, the output buffer 4022 temporarily stores the receivedsecond soft decision value. Thereafter, the output buffer 4022 outputsthe second soft decision value to the data deformatter 1006. Forexample, the output buffer 4022 overwrites the second soft decisionvalue of the symbol decoder 4018 until the turbo decoding process isperformed for M number of times. Then, once all M number of turbodecoding processes is performed for a single TBL, the correspondingsecond soft decision value is outputted to the data deformatter 1006.

The feedback controller 4010 controls the number of turbo decoding andturbo decoding repetition processes of the overall block decoder, shownin FIG. 57. More specifically, once the turbo decoding process has beenrepeated for a predetermined number of times, the second soft decisionvalue of the symbol decoder 4018 is outputted to the data deformatter1006 through the output buffer 4022. Thus, the block decoding process ofa turbo block is completed. In the description of the present invention,this process is referred to as a regressive turbo decoding process forsimplicity. At this point, the number of regressive turbo decodingrounds between the trellis decoding unit 4012 and the symbol decoder4018 may be defined while taking into account hardware complexity anderror correction performance. Accordingly, if the number of roundsincreases, the error correction performance may be enhanced. However,this may lead to a disadvantage of the hardware becoming morecomplicated (or complex).

Meanwhile, the data deinterleaver 1009, the RS decoder 4010, and thedata derandomizer 4011 correspond to blocks required for receiving themain service data. Therefore, the above-mentioned blocks may not benecessary (or required) in the structure of a digital broadcastreceiving system for receiving mobile service data only. The datadeinterleaver performs an inverse process of the data interleaverincluded in the transmitting system. In other words, the datadeinterleaver 1009 deinterleaves the main service data outputted fromthe block decoder 1005 and outputs the deinterleaved main service datato the RS decoder 1010. The data being inputted to the datadeinterleaver 1009 include main service data, as well as mobile servicedata, known data, RS parity data, and an MPEG header.

The RS decoder 1010 performs a systematic RS decoding process on thedeinterleaved data and outputs the processed data to the dataderandomizer 1011. The data derandomizer receives the output of the RSdecoder 1010 and generates a pseudo random data byte identical to thatof the randomizer included in the digital broadcast transmitting system.Thereafter, the data derandomizer 1011 performs a bitwise exclusive OR(XOR) operation on the generated pseudo random data byte, therebyinserting the MPEG synchronization bytes to the beginning of each packetso as to output the data in 188-byte main service data packet units.

Meanwhile, the data being outputted from the block decoder to the datadeformatter 1006 are inputted in the form of a data group. At thispoint, the data deformatter 1006 already knows the structure of the datathat are to be inputted and is, therefore, capable of identifying thesignaling information including system information and the mobileservice data from the data group. Thereafter, the data deformatter 1006outputs the identified signaling information to a block (which will bedescribed in detail with reference to FIG. 60) for processing thesignaling information and outputs the identified mobile service data tothe RS frame decoder 1007.

RS Frame Decoder within Receiving System

More specifically, the RS frame decoder 1007 receives only theRS-encoded and/or CRC-encoded mobile service data that are transmittedfrom the data deformatter 1006. The RS frame encoder 1007 performs aninverse process of the RS frame encoder included in the transmittingsystem so as to correct the error within the RS frame. Then, the RSframe decoder 1007 adds the 1-byte MPEG synchronization service datapacket, which had been removed during the RS frame encoding process, tothe error-corrected mobile service data packet. Thereafter, theprocessed data packet is outputted to the derandomizer 1008.

FIG. 58 illustrates a process of grouping a plurality of data groups(e.g., 18 data groups) to create a RS frame and a RS frame reliabilitymap, and also a process of performing data deinterleaving in super frameunits as an inverse process of the transmitting system and identifyingthe deinterleaved RS frame and RS frame reliability map. Morespecifically, the RS frame decoder 1007 groups the inputted mobileservice data so as to create a RS frame. The mobile service data havebeen RS-encoded RS frame units by the transmitting system, and theninterleaved in super frame units. At this point, the error correctionencoding process (e.g., the CRC encoding process) may have beenperformed on the mobile service data, or the error correction encodingprocess may have been omitted.

If it is assumed that the transmitting system has divided the RS framehaving the size of (N+2)*(187+P) bytes into M number of data groups(wherein, for example, M is equal to 18) and then transmitted thedivided RS frame, the receiving system groups the mobile service data ofeach data group, as shown in FIG. 58( a), so as to create a RS framehaving the size of (N+2)*(187+P) bytes. At this point, if a dummy bytehas been added to at least one of the data groups configuring thecorresponding RS frame and, then, transmitted, the dummy byte isremoved, and a RS frame and a RS frame reliability map are created. Forexample, as shown in FIG. 14, if K number of dummy bytes has been added,the RS frame and RS frame reliability map are created after the K numberof dummy bytes has been removed.

Furthermore, if it is assumed that the RS frame is divided into 18 datagroups, which are then transmitted from a single burst-on section, thereceiving system also groups mobile service data of 18 data groupswithin the corresponding burst section, thereby creating the RS frame.Herein, when it is assumed that the block decoder 1005 outputs a softdecision value for the decoding result, the RS frame decoder may decidethe ‘0’ and ‘1’ of the corresponding bit by using the codes of the softdecision value. 8 bits that are each decided as described above aregrouped to create one data byte. If the above-described process isperformed on all soft decision values of the 18 data groups included ina single burst, the RS frame having the size of (N+2)*(187+P) bytes maybe configured. Additionally, the present invention uses the softdecision value not only to configure the RS frame but also to configurea reliability map. Herein, the reliability map indicates the reliabilityof the corresponding data byte, which is configured by grouping 8 bits,wherein the 8 bits are decided by the codes of the soft decision value.

For example, when the absolute value of the soft decision value exceedsa pre-determined threshold value, the value of the corresponding bit,which is decided by the code of the corresponding soft decision value,is determined to be reliable. Conversely, when the absolute value of thesoft decision value does not exceed the pre-determined threshold value,the value of the corresponding bit is determined to be unreliable.Thereafter, if even a single bit among the 8 bits, which are decided bythe codes of the soft decision value and grouped to configure one databyte, is determined to be unreliable, the corresponding data byte ismarked on the reliability map as an unreliable data byte.

Herein, determining the reliability of one data byte is only exemplary.More specifically, when a plurality of data bytes (e.g., at least 4 databytes) are determined to be unreliable, the corresponding data bytes mayalso be marked as unreliable data bytes within the reliability map.Conversely, when all of the data bits within the one data byte aredetermined to be reliable (i.e., when the absolute value of the softdecision values of all 8 bits included in the one data byte exceed thepredetermined threshold value), the corresponding data byte is marked tobe a reliable data byte on the reliability map. Similarly, when aplurality of data bytes (e.g., at least 4 data bytes) are determined tobe reliable, the corresponding data bytes may also be marked as reliabledata bytes within the reliability map. The numbers proposed in theabove-described example are merely exemplary and, therefore, do notlimit the scope or spirit of the present invention.

The process of configuring the RS frame and the process of configuringthe reliability map both using the soft decision value may be performedat the same time. Herein, the reliability information within thereliability map is in a one-to-one correspondence with each byte withinthe RS frame. For example, if a RS frame has the size of (N+2)*(187+P)bytes, the reliability map is also configured to have the size of(N+2)*(187+P) bytes. FIG. 58( a′) and FIG. 58( b′) respectivelyillustrate the process steps of configuring the reliability mapaccording to the present invention.

At this point, the RS frame of FIG. 58( b) and the RS frame reliabilitymap of FIG. 58( b′) are interleaved in super frame units (as shown inFIG. 6). Therefore, the RS frame and the RS frame reliability maps aregrouped to create a super frame and a super frame reliability map.Subsequently, as shown in FIG. 58( c) and FIG. 58( c′), a de-permutation(or deinterleaving) process is performed in super frame units on the RSframe and the RS frame reliability maps, as an inverse process of thetransmitting system. Then, when the de-permutation process is performedin super frame units, the processed data are divided into de-permuted(or deinterleaved) RS frames having the size of (N+2)*(187+P) bytes andde-permuted RS frame reliability maps having the size of (N+2)*(187+P)bytes, as shown in FIG. 58( d) and FIG. 58( d′). Subsequently, the RSframe reliability map is used on the divided RS frames so as to performerror correction.

FIG. 59 illustrates example of the error correction processed accordingto embodiments of the present invention. FIG. 59 illustrates an exampleof performing an error correction process when the transmitting systemhas performed both RS encoding and CRC encoding processes on the RSframe (as shown in FIG. 5). As shown in FIG. 59( a) and FIG. 59( a′),when the RS frame having the size of (N+2)*(187+P) bytes and the RSframe reliability map having the size of (N+2)*(187+P) bytes arecreated, a CRC syndrome checking process is performed on the created RSframe, thereby verifying whether any error has occurred in each row.Subsequently, as shown in FIG. 59( b), a 2-byte checksum is removed toconfigure an RS frame having the size of N*(187+P) bytes. Herein, thepresence (or existence) of an error is indicated on an error flagcorresponding to each row. Similarly, since the portion of thereliability map corresponding to the CRC checksum has hardly anyapplicability, this portion is removed so that only N*(187+P) number ofthe reliability information bytes remain, as shown in FIG. 59( b′).

After performing the CRC syndrome checking process, as described above,a RS decoding process is performed in a column direction. Herein, a RSerasure correction process may be performed in accordance with thenumber of CRC error flags. More specifically, as shown in FIG. 59( c),the CRC error flag corresponding to each row within the RS frame isverified. Thereafter, the RS frame decoder 1005 determines whether thenumber of rows having a CRC error occurring therein is equal to orsmaller than the maximum number of errors on which the RS erasurecorrection may be performed, when performing the RS decoding process ina column direction. The maximum number of errors corresponds to P numberof parity bytes inserted when performing the RS encoding process. In theembodiment of the present invention, it is assumed that 48 parity byteshave been added to each column (i.e., P=48).

If the number of rows having the CRC errors occurring therein is smallerthan or equal to the maximum number of errors (i.e., 48 errors accordingto this embodiment) that can be corrected by the RS erasure decodingprocess, a (235,187)-RS erasure decoding process is performed in acolumn direction on the RS frame having (187+P) number of N-byte rows(i.e., 235 N-byte rows), as shown in FIG. 59( d). Thereafter, as shownin FIG. 59( e), the 48-byte parity data that have been added at the endof each column are removed. Conversely, however, if the number of rowshaving the CRC errors occurring therein is greater than the maximumnumber of errors (i.e., 48 errors) that can be corrected by the RSerasure decoding process, the RS erasure decoding process cannot beperformed. In this case, the error may be corrected by performing ageneral RS decoding process. In addition, the reliability map, which hasbeen created based upon the soft decision value along with the RS frame,may be used to further enhance the error correction ability (orperformance) of the present invention.

More specifically, the RS frame decoder compares the absolute value ofthe soft decision value of the block decoder 1005 with thepre-determined threshold value, so as to determine the reliability ofthe bit value decided by the code of the corresponding soft decisionvalue. Also, 8 bits, each being determined by the code of the softdecision value, are grouped to form one data byte. Accordingly, thereliability information on this one data byte is indicated on thereliability map. Therefore, as shown in FIG. 59( c), even though aparticular row is determined to have an error occurring therein basedupon a CRC syndrome checking process on the particular row, the presentinvention does not assume that all bytes included in the row have errorsoccurring therein. The present invention refers to the reliabilityinformation of the reliability map and sets only the bytes that havebeen determined to be unreliable as erroneous bytes. In other words,with disregard to whether or not a CRC error exists within thecorresponding row, only the bytes that are determined to be unreliablebased upon the reliability map are set as erasure points.

According to another method of the present invention, when it isdetermined that CRC errors are included in the corresponding row, basedupon the result of the CRC syndrome checking result, only the bytes thatare determined by the reliability map to be unreliable are set aserrors. More specifically, only the bytes corresponding to the row thatis determined to have errors included therein and being determined to beunreliable based upon the reliability information, are set as theerasure points. Thereafter, if the number of error points for eachcolumn is smaller than or equal to the maximum number of errors (i.e.,48 errors) that can be corrected by the RS erasure decoding process, anRS erasure decoding process is performed on the corresponding column.Conversely, if the number of error points for each column is greaterthan the maximum number of errors (i.e., 48 errors) that can becorrected by the RS erasure decoding process, a general decoding processis performed on the corresponding column.

More specifically, if the number of rows having CRC errors includedtherein is greater than the maximum number of errors (i.e., 48 errors)that can be corrected by the RS erasure decoding process, either an RSerasure decoding process or a general RS decoding process is performedon a column that is decided based upon the reliability information ofthe reliability map, in accordance with the number of erasure pointswithin the corresponding column. For example, it is assumed that thenumber of rows having CRC errors included therein within the RS frame isgreater than 48. And, it is also assumed that the number of erasurepoints decided based upon the reliability information of the reliabilitymap is indicated as 40 erasure points in the first column and as 50erasure points in the second column. In this case, a (235,187)-RSerasure decoding process is performed on the first column.Alternatively, a (235,187)-RS decoding process is performed on thesecond column. When error correction decoding is performed on all columndirections within the RS frame by using the above-described process, the48-byte parity data which were added at the end of each column areremoved, as shown in FIG. 59( e).

As described above, even though the total number of CRC errorscorresponding to each row within the RS frame is greater than themaximum number of errors that can be corrected by the RS erasuredecoding process, while performing error correction decoding on theparticular column, when the number of bytes determined to have a lowreliability level, based upon the reliability information on thereliability map within a particular column, RS erasure decoding may beperformed on the corresponding column. Herein, the difference betweenthe general RS decoding process and the RS erasure decoding process isthe number of errors that can be corrected.

More specifically, when performing the general RS decoding process, thenumber of errors corresponding to half of the number of parity bytes(i.e., (number of parity bytes)/2) that are inserted during the RSencoding process may be error corrected (e.g., 24 errors may becorrected). Alternatively, when performing the RS erasure decodingprocess, the number of errors corresponding to the number of paritybytes that are inserted during the RS encoding process may be errorcorrected (e.g., 48 errors may be corrected).

After performing the error correction decoding process, as describedabove, a RS frame configured of 187 N-byte rows (or packet) may beobtained as shown in FIG. 59( e). The RS frame having the size of N*187bytes is outputted by the order of N number of 187-byte units. At thispoint, 1 MPEG synchronization byte, which had been removed by thetransmitting system, is added to each 187-byte packet, as shown in FIG.59( f). Therefore, a 188-byte unit mobile service data packet isoutputted. As described above, the RS frame decoded mobile service dataare outputted to the data derandomizer 1008. The data derandomizer 1008performs a derandomizing process, which corresponds to an inverseprocess of the randomizer included in the transmitting system, on theinputted mobile service data. Then, by outputting the derandomized data,the mobile service data transmitted from the transmitting system may beobtained.

SCCC Mode Detection and Burst On/Off Control

FIG. 60 illustrates an example of a digital broadcast receiving systemaccording to the present invention. The operation of the receivingsystem will now be described in detail with reference to FIG. 60. Thereceiving system shown in FIG. 60 includes the blocks shown in FIG. 30.Therefore, detailed description of the functions of the blocks shown inFIG. 30 will be omitted for simplicity. Referring to FIG. 8 and FIG. 9,signaling information may be included in the field synchronizationregion, the known data region, and the mobile service data region.Herein, the signaling information may transmit various types oftransmission parameters.

The demodulator 1002 outputs field synchronization data or known dataincluding transmission parameters to a transmission (Tx) parameterdetector/parser 1013. The equalizer 1003 may perform channelequalization on the demodulated signal and output the equalized signalto the Tx parameter detector/parser 1013. The Tx parameterdetector/parser 1013 may detect a SCCC mode from the data outputted fromthe equalizer 1003. Also, when the Tx parameter detector/parser 1013outputs the SCCC mode information to the block decoder 1005 and the RSframe decoder 1007, the block decoder 1005 may perform block decoding onmobile service data based upon the detected SCCC mode. The datadeformatter 1006 identifies the RS encoded signaling information and theRS frame encoded mobile service data from the output of the blockdecoder 1005. Then, the data deformatter 1006 outputs the identified RSencoded signaling information and the RS frame encoded mobile servicedata to the Tx parameter detector/parser 1013 and the RS frame decoder1007, respectively.

The Tx parameter detector/parser 1013 detects transmission parametersfrom the signal(s) outputted from the demodulator 1002, the equalizer1003, and the data deformatter 1006. For example, the Tx parameterdetector/parser 1013 obtains the location information of the known datafrom the known sequence detector 1004 and detects a SCCC mode from theoutput signal of the demodulator 1002 or the equalizer 1003. Then, thedetected SCCC mode is outputted to the block decoder 1005 and the RSframe decoder 1007, respectively. An example of the Tx parameterdetector/parser 1013 detecting the SCCC mode will be described in moredetail with reference to FIG. 62.

The block decoder 1005 performs error correction decoding on thereceived data based upon the SCCC mode provided from the Tx parameterdetector/parser 1013. The data deformatter 1006 identifies the dataconfiguring the RS frame and the data including the transmissionparameters from the output data of the block decoder 1005. Then, theblock decoder 1005 outputs the identified data to the RS frame decoder1007 and the Tx parameter detector/parser 1013, respectively. The RSframe decoder 1007 performs error correction decoding in RS frame unitson the received data and outputs the error correction decoded mobileservice data to the de-randomizer 1008. The Tx parameter detector/parser1013 performs error correction decoding (e.g., RS decoding) on thereceived data, thereby detecting transmission parameters other than aSCCC mode. The transmission parameters detected from the output data ofthe block decoder 1005 by the Tx parameter detector/parser 1013 includeat least one of a service identifier (ID), an RS mode for regions A andB of a signal frame, an RS mode for region C of the signal frame, asuper frame size (SFS), a permuted frame index (PFI) indicating thelocation information of an RS frame in a super frame, a burst size (BS),a data group index (G1), and a time to a next burst (TNB).

The Tx parameter detector/parser 1013 may output the detected burstinformation including the burst size (BS), the data group index (GI),and the time to a next burst (TNB) to the known sequence detector 1004.Meanwhile, the known sequence detector 1004 outputs information on aburst section to the burst controller using the burst information. Morespecifically, the known sequence detector 1004 detects the position ofknown data within a transmission frame, while the transmission frame isbeing received. Then, the known sequence position indicator may beoutputted to the demodulator 1002 and the equalizer 1003. Also, theknown sequence detector 1004 may estimate the initial frequency offsetand output the estimated initial frequency offset to a carrier waverecovery unit within the demodulator 1002. The known sequence detector1004 obtains frame synchronization and outputs a group valid indicatorand a burst valid indicator to the burst controller 5000. The burstcontroller 5000 may control the on/off state of the power supply of thefunction blocks included in the dotted area. Therefore, the powerconsumption of the broadcast receiving system can be reduced even whenthe broadcast receiving system receives broadcast signals in a mobilestate.

A burst of data includes a plurality of data groups, and varioustransmission parameters with respect to the data group of the same burstsection, such as an RS mode for regions A and B in a data frame, an RSmode for region C in the data frame, a super frame size (SFS), apermuted frame index (PFI), and a burst size (BS) for the data groupsmay have the same value. By having the same data values, when a burstincludes a plurality of data groups, there are various ways of detectingand using the transmission parameters of the data groups. In a firstexample, the transmission parameters of all the data groups must besuccessfully detected or decoded in order to be used. In a secondexample, when the transmission parameters included in a particular datagroup are successfully detected or decoded, the detected parameters canbe used assuming that the detected parameters of the particular groupare identical to those of the remaining data group(s). Transmissionparameters may include an error due to channel distortion or noise.Therefore, the transmission parameters which are previously detected canbe used if a number of errors included in current transmissionparameters is greater than a predetermined value. Alternatively, newtransmission parameters which are successfully detected can be used ifthe number of errors in the current transmission parameters is greaterthan the predetermined value.

FIG. 61 illustrates a block diagram of the Tx parameter detector/parser1013 shown in FIG. 60 in detail. Referring to FIG. 61, the Tx parameterdetector/parser 1013 includes a mode detector 5011 and a signaling RSdecoder 5013. The mode detector 5011 detects a SCCC mode from the signaloutputted from the channel equalizer 1003 and outputs the detected SCCCmode to the block decoder 1005 and the RS frame decoder 1007. Theexample of the mode detector 5011 detecting the SCCC mode will bedescribed in detail with reference to FIG. 62. Meanwhile, the signalingRS decoder 5013 performs RS decoding on the signaling data provided fromthe data deformatter 1006 (or from the block decoder 1005) and obtainstransmission parameters.

The transmission parameters include at least one of a service identifier(ID), an RS mode for regions A and B of a signal frame, an RS mode forregion C of the signal frame, a super frame size (SFS), a permuted frameindex (PFI) indicating the location information of an RS frame in asuper frame, a burst size (BS), a data group index (GI), and a time to anext burst (TNB). The transmission parameters detected by the signalingRS decoder 1013 are applicable to a data group including thetransmission parameters, and the data group index (GI) and the timing toa next burst (TNB) (or burst period (BP)) can be renewed or updated foreach data group, thereby being transmitted and received. The RS modeobtained by the signaling RS decoder 5013 is provided to the RS framedecoder which performs error correction decoding on an RS frameincluding the mobile service data using the RS mode.

FIG. 62 illustrates a block diagram of the Tx parameter detector/parserdetecting the SCCC mode. Herein, the Tx parameter detector/parser 1013may receive known data having the SCCC mode set up by the demodulatorand the equalizer. The data point controller determines the location ofthe known data and allows the pattern correlators 5120 a, 5120 b, . . ., 5120 n to receive data symbols corresponding to a data regionincluding the signaling information. Then, each pattern correlator 5120calculates and outputs correlation values of the data symbols. Themaximum value decision unit 5130 receives the output of each patterncorrelator 5210 and decides the signal pattern of the pattern correlator5120 having the maximum correlation value as the SCCC mode known datapredetermined by the transmitting system. The SCCC mode decided by themaximum value decision unit 5130 may be outputted to the block decoder1005 or RS frame decoder 1007.

FIG. 63 illustrates an example of the known sequence detector 1004outputting the group valid information (i.e., group valid indicator).Referring to FIG. 63, when a partial correlation value of a broadcastsignal is checked according to a cycle period of a counter, a peak valueof the partial correlation value corresponding to a data group position(marked as a group) of the broadcast signal, wherein the data groupincludes known data, may be indicated. The known sequence detector 1004may output a group valid indicator corresponding to the position wherethe partial correlation value is generated.

FIG. 64 illustrates an example of the known sequence detector 1004outputting the burst valid information (i.e., burst valid indicator).Herein, the known sequence detector 1004 may obtain burst informationfrom the signaling information, wherein the burst information mayinclude burst cycle information (i.e., one burst cycle corresponds to 30fields in the example shown in FIG. 64) and burst length (i.e., oneburst corresponds to 18 fields in the example shown in FIG. 64). In adata group corresponding to a data section including mobile servicedata, partial correlation values may periodically occur as shown in theexample of FIG. 63.

The burst controller 5000 receives the group valid indicator and burstvalid indicator and may use the received information to control poweron/off states of the receiving system, so as to allow the system toprocess only the signal of the mobile service data section including theuser-desired broadcast program. If the broadcast receiving system wishes(or desires) to receive only the mobile service data, the systemconsiders only the mobile service data group included in thecorresponding burst as the valid data. Accordingly, the receiving systemdoes not receive data other than the mobile service data group of thecorresponding burst. When data corresponding to the mobile service datagroup are being processed, even though the corresponding data areincluded in the burst section, the burst controller 5000 may use thegroup valid indicator, which is generated while the data that are beingprocessed, so as to turn the power on or off.

FIG. 65 illustrates an example of comparing actual on/off time and theburst section. Referring to FIG. 65, (a) represents a data receivingsection based upon the burst valid indicator and the group validindicator. The broadcast receiving system may turn the power on startingfrom an arbitrary (or random) time prior to a burst starting point or adata group starting point (i.e., set-up time). Alternatively, thebroadcast receiving system may turn the power off starting from anarbitrary (or random) time after a burst ending point or a data groupending point (i.e., hold time). Herein, the set-up time or the hold timemay be adjusted arbitrarily depending upon specific circumstances.

FIG. 66 illustrates a block diagram showing a structure of a receivingsystem according to an embodiment of the present invention. Herein, thedemodulating unit of FIG. 30 may be applied in the digital broadcastreceiving system. Referring to FIG. 66, the digital broadcast receivingsystem includes a tuner 6001, a demodulating unit 6002, a demultiplexer6003, an audio decoder 6004, a video decoder 6005, a native TVapplication manager 6006, a channel manager 6007, a channel map 6008, afirst memory 6009, an SI and/or data decoder 6010, a second memory 6011,a system manager 6012, a data broadcast application manager 6013, astorage controller 6014, a third memory 6015, and a GPS module 6020.Herein, the first memory 6009 corresponds to a non-volatile randomaccess memory (NVRAM) (or a flash memory). The third memory 6015corresponds to a large-scale storage device, such as a hard disk drive(HDD), a memory chip, and so on.

The tuner 6001 tunes a frequency of a specific channel through any oneof an antenna, cable, and satellite. Then, the tuner 6001 down-convertsthe tuned frequency to an intermediate frequency (IF), which is thenoutputted to the demodulating unit 6002. At this point, the tuner 6001is controlled by the channel manager 6007. Additionally, the result andstrength of the broadcast signal of the tuned channel are also reportedto the channel manager 6007. The data that are being received by thefrequency of the tuned specific channel include main service data,mobile service data, and table data for decoding the main service dataand mobile service data.

According to the embodiment of the present invention, audio data andvideo data for mobile broadcast programs may be applied as the mobileservice data. Such audio data and video data are compressed by varioustypes of encoders so as to be transmitted to a broadcasting station. Inthis case, the video decoder 6004 and the audio decoder 6005 will beprovided in the receiving system so as to correspond to each of theencoders used for the compression process. Thereafter, the decodingprocess will be performed by the video decoder 6004 and the audiodecoder 6005. Then, the processed video and audio data will be providedto the users. Examples of the encoding/decoding scheme for the audiodata may include AC 3, MPEG 2 AUDIO, MPEG 4 AUDIO, AAC, AAC+, HE AAC,AAC SBR, MPEG-Surround, and BSAC. And, examples of the encoding/decodingscheme for the video data may include MPEG 2 VIDEO, MPEG 4 VIDEO, H.264,SVC, and VC-1.

Depending upon the embodiment of the present invention, examples of themobile service data may include data provided for data service, such asJava application data, HTML application data, XML data, and so on. Thedata provided for such data services may correspond either to a Javaclass file for the Java application, or to a directory file designatingpositions (or locations) of such files. Furthermore, such data may alsocorrespond to an audio file and/or a video file used in eachapplication. The data services may include weather forecast services,traffic information services, stock information services, servicesproviding information quiz programs providing audience participationservices, real time poll, user interactive education programs, gamingservices, services providing information on soap opera (or TV series)synopsis, characters, original sound track, filing sites, servicesproviding information on past sports matches, profiles andaccomplishments of sports players, product information and productordering services, services providing information on broadcast programsby media type, airing time, subject, and so on. The types of dataservices described above are only exemplary and are not limited only tothe examples given herein. Furthermore, depending upon the embodiment ofthe present invention, the mobile service data may correspond to metadata. For example, the meta data be written in XML format so as to betransmitted through a DSM-CC protocol.

The demodulating unit 6002 performs VSB-demodulation and channelequalization on the signal being outputted from the tuner 6001, therebyidentifying the main service data and the mobile service data.Thereafter, the identified main service data and mobile service data areoutputted in TS packet units. An example of the demodulating unit 6002is shown in FIG. 30 to FIG. 65. Therefore, the structure and operationof the demodulator will be described in detail in a later process.However, this is merely exemplary and the scope of the present inventionis not limited to the example set forth herein. In the embodiment givenas an example of the present invention, only the mobile service datapacket outputted from the demodulating unit 6002 is inputted to thedemultiplexer 6003. In this case, the main service data packet isinputted to another demultiplexer (not shown) that processes mainservice data packets. Herein, the storage controller 6014 is alsoconnected to the other demultiplexer in order to store the main servicedata after processing the main service data packets. The demultiplexerof the present invention may also be designed to process both mobileservice data packets and main service data packets in a singledemultiplexer.

The storage controller 6014 is interfaced with the demultiplexer so asto control instant recording, reserved (or pre-programmed) recording,time shift, and so on of the mobile service data and/or main servicedata. For example, when one of instant recording, reserved (orpre-programmed) recording, and time shift is set and programmed in thereceiving system (or receiver) shown in FIG. 66, the correspondingmobile service data and/or main service data that are inputted to thedemultiplexer are stored in the third memory 6015 in accordance with thecontrol of the storage controller 6014. The third memory 6015 may bedescribed as a temporary storage area and/or a permanent storage area.Herein, the temporary storage area is used for the time shiftingfunction, and the permanent storage area is used for a permanent storageof data according to the user's choice (or decision).

When the data stored in the third memory 6015 need to be reproduced (orplayed), the storage controller 6014 reads the corresponding data storedin the third memory 6015 and outputs the read data to the correspondingdemultiplexer (e.g., the mobile service data are outputted to thedemultiplexer 6003 shown in FIG. 66). At this point, according to theembodiment of the present invention, since the storage capacity of thethird memory 6015 is limited, the compression encoded mobile servicedata and/or main service data that are being inputted are directlystored in the third memory 6015 without any modification for theefficiency of the storage capacity. In this case, depending upon thereproduction (or reading) command, the data read from the third memory6015 pass trough the demultiplexer so as to be inputted to thecorresponding decoder, thereby being restored to the initial state.

The storage controller 6014 may control the reproduction (or play),fast-forward, rewind, slow motion, instant replay functions of the datathat are already stored in the third memory 6015 or presently beingbuffered. Herein, the instant replay function corresponds to repeatedlyviewing scenes that the viewer (or user) wishes to view once again. Theinstant replay function may be performed on stored data and also on datathat are currently being received in real time by associating theinstant replay function with the time shift function. If the data beinginputted correspond to the analog format, for example, if thetransmission mode is NTSC, PAL, and so on, the storage controller 6014compression encodes the inputted data and stored the compression-encodeddata to the third memory 6015. In order to do so, the storage controller6014 may include an encoder, wherein the encoder may be embodied as oneof software, middleware, and hardware. Herein, an MPEG encoder may beused as the encoder according to an embodiment of the present invention.The encoder may also be provided outside of the storage controller 6014.

Meanwhile, in order to prevent illegal duplication (or copies) of theinput data being stored in the third memory 6015, the storage controller6014 scrambles (or encrypts) the input data and stores the scrambled (orencrypted) data in the third memory 6015. Accordingly, the storagecontroller 6014 may include a scramble algorithm (or encryptionalgorithm) for scrambling the data stored in the third memory 6015 and adescramble algorithm (or decryption algorithm) for descrambling (ordecrypting) the data read from the third memory 6015. The scramblingmethod may include using an arbitrary key (e.g., control word) to modifya desired set of data, and also a method of mixing signals.

Meanwhile, the demultiplexer 6003 receives the real-time data outputtedfrom the demodulating unit 6002 or the data read from the third memory6015 and demultiplexes the received data. In the example given in thepresent invention, the demultiplexer 6003 performs demultiplexing on themobile service data packet. Therefore, in the present invention, thereceiving and processing of the mobile service data will be described indetail. However, depending upon the many embodiments of the presentinvention, not only the mobile service data but also the main servicedata may be processed by the demultiplexer 6003, the audio decoder 6004,the video decoder 6005, the native TV application manager 6006, thechannel manager 6007, the channel map 6008, the first memory 6009, theSI and/or data decoder 6010, the second memory 6011, a system manager6012, the data broadcast application manager 6013, the storagecontroller 6014, the third memory 6015, and the GPS module 6020.Thereafter, the processed data may be used to provide diverse servicesto the users.

The demultiplexer 6003 demultiplexes mobile service data and systeminformation (SI) tables from the mobile service data packet inputted inaccordance with the control of the SI and/or data decoder 6010.Thereafter, the demultiplexed mobile service data and SI tables areoutputted to the SI and/or data decoder 6010 in a section format. Inthis case, it is preferable that data for the data service are used asthe mobile service data that are inputted to the SI and/or data decoder6010. In order to extract the mobile service data from the channelthrough which mobile service data are transmitted and to decode theextracted mobile service data, system information is required. Suchsystem information may also be referred to as service information. Thesystem information may include channel information, event information,etc. In the embodiment of the present invention, the PSI/PSIP tables areapplied as the system information. However, the present invention is notlimited to the example set forth herein. More specifically, regardlessof the name, any protocol transmitting system information in a tableformat may be applied in the present invention.

The PSI table is an MPEG-2 system standard defined for identifying thechannels and the programs. The PSIP table is an advanced televisionsystems committee (ATSC) standard that can identify the channels and theprograms. The PSI table may include a program association table (PAT), aconditional access table (CAT), a program map table (PMT), and a networkinformation table (NIT). Herein, the PAT corresponds to specialinformation that is transmitted by a data packet having a PID of ‘0’.The PAT transmits PID information of the PMT and PID information of theNIT corresponding to each program. The CAT transmits information on apaid broadcast system used by the transmitting system. The PMT transmitsPID information of a transport stream (TS) packet, in which programidentification numbers and individual bit sequences of video and audiodata configuring the corresponding program are transmitted, and the PIDinformation, in which PCR is transmitted. The NIT transmits informationof the actual transmission network.

The PSIP table may include a virtual channel table (VCT), a system timetable (STT), a rating region table (RRT), an extended text table (ETT),a direct channel change table (DCCT), an event information table (EIT),and a master guide table (MGT). The VCT transmits information on virtualchannels, such as channel information for selecting channels andinformation such as packet identification (PID) numbers for receivingthe audio and/or video data. More specifically, when the VCT is parsed,the PID of the audio/video data of the broadcast program may be known.Herein, the corresponding audio/video data are transmitted within thechannel along with the channel name and the channel number.

FIG. 67 illustrates a VCT syntax according to an embodiment of thepresent invention. The VCT syntax of FIG. 67 is configured by includingat least one of a table_id field, a section_syntax_indicator field, aprivate_indicator field, a section_length field, a transport_stream idfield, a version_number field, a current_next_indicator field, asection_number field, a last_section_number field, a protocol_versionfield, and a num_channels_in_section field.

The VCT syntax further includes a first ‘for’ loop repetition statementthat is repeated as much as the num_channels_in_section field value. Thefirst repetition statement may include at least one of a short_namefield, a major_channel_number field, a minor_channel_number field, amodulation_mode field, a carrier_frequency field, a channel_TSID field,a program_number field, an ETM_location field, an access_controlledfield, a hidden field, a service_type field, a source_id field, adescriptor_length field, and a second ‘for’ loop statement that isrepeated as much as the number of descriptors included in the firstrepetition statement. Herein, the second repetition statement will bereferred to as a first descriptor loop for simplicity. The descriptordescriptors( ) included in the first descriptor loop is separatelyapplied to each virtual channel.

Furthermore, the VCT syntax may further include anadditional_descriptor_length field, and a third ‘for’ loop statementthat is repeated as much as the number of descriptors additionally addedto the VCT. For simplicity of the description of the present invention,the third repetition statement will be referred to as a seconddescriptor loop. The descriptor additional_descriptors( ) included inthe second descriptor loop is commonly applied to all virtual channelsdescribed in the VCT.

As described above, referring to FIG. 67, the table_id field indicates aunique identifier (or identification) (ID) that can identify theinformation being transmitted to the table as the VCT. Morespecifically, the table_id field indicates a value informing that thetable corresponding to this section is a VCT. For example, a 0xC8 valuemay be given to the table_id field.

The version_number field indicates the version number of the VCT. Thesection_number field indicates the number of this section. Thelast_section_number field indicates the number of the last section of acomplete VCT. And, the num_channel_in_section field designates thenumber of the overall virtual channel existing within the VCT section.Furthermore, in the first ‘for’ loop repetition statement, theshort_name field indicates the name of a virtual channel. Themajor_channel_number field indicates a ‘major’ channel number associatedwith the virtual channel defined within the first repetition statement,and the minor_channel_number field indicates a ‘minor’ channel number.More specifically, each of the channel numbers should be connected tothe major and minor channel numbers, and the major and minor channelnumbers are used as user reference numbers for the corresponding virtualchannel.

The program_number field is shown for connecting the virtual channelhaving an MPEG-2 program association table (PAT) and program map table(PMT) defined therein, and the program_number field matches the programnumber within the PAT/PMT. Herein, the PAT describes the elements of aprogram corresponding to each program number, and the PAT indicates thePID of a transport packet transmitting the PMT. The PMT describedsubordinate information, and a PID list of the transport packet throughwhich a program identification number and a separate bit sequence, suchas video and/or audio data configuring the program, are beingtransmitted.

FIG. 68 illustrates a service_type field according to an embodiment ofthe present invention. The service_type field indicates the service typeprovided in a corresponding virtual channel. Referring to FIG. 68, it isprovided that the service_type field should only indicate an analogtelevision, a digital television, digital audio data, and digital videodata. Also, according to the embodiment of the present invention, it maybe provided that a mobile broadcast program should be designated to theservice_type field. The service_type field, which is parsed by the SIand/or data decoder 6010 may be provided to a receiving system, as shownin FIG. 66, and used accordingly. According to other embodiments of thepresent invention, the parsed service_type field may also be provided toeach of the audio decoder 6004 and video decoder 6005, so as to be usedin the decoding process.

The source_id field indicates a program source connected to thecorresponding virtual channel. Herein, a source refers to a specificsource, such as an image, a text, video data, or sound. The source_idfield value has a unique value within the transport stream transmittingthe VCT. Meanwhile, a service location descriptor may be included in adescriptor loop (i.e., descriptor{ }) within a next ‘for’ looprepetition statement. The service location descriptor may include astream type, PID, and language code for each elementary stream.

FIG. 69 illustrates a service location descriptor according to anembodiment of the present invention. As shown in FIG. 69, the servicelocation descriptor may include a descriptor_tag field, adescriptor_length field, and a PCR_PID field. Herein, the PCR_PID fieldindicates the PID of a transport stream packet within a programspecified by a program_number field, wherein the transport stream packetincludes a valid PCR field. Meanwhile, the service location descriptorincludes a number_elements field so as to indicate a number of PIDs usedin the corresponding program. The number of repetition of a next ‘for’descriptor loop repetition statement can be decided, depending upon thevalue of the number_elements field. Referring to FIG. 69, the ‘for’ looprepetition statement includes a stream_type field, an elementary_PIDfield, and an ISO_(—)639_language_code field. Herein, the stream_typefield indicates the stream type of the corresponding elementary stream(i.e., video/audio data). The elementary_PID field indicates the PID ofthe corresponding elementary stream. The ISO_(—)639_language_code fieldindicates a language code of the corresponding elementary stream.

FIG. 70 illustrates examples that may be assigned to the stream_typefield according to the present invention. As shown in FIG. 70, ISO/IEC11172 Video, ITU-T Rec. H.262|ISO/IEC 13818-2 Video or ISO/IEC 11172-2constrained parameter video stream, ISO/IEC 11172 Audio, ISO/IEC 13818-3Audio, ITU-T Rec. H.222.0|ISO/IEC 13818-1 private_sections, ITU-T Rec.H.222.0|ISO/IEC 13818-1 PES packets containing private data, ISO/IEC13522 MHEG, ITU-T Rec. H.222.0|ISO/IEC 13818-1 Annex A DSM CC, ITU-TRec. H.222.1, ISO/IEC 13818-6 type A, ISO/IEC 13818-6 type B, ISO/IEC13818-6 type C, ISO/IEC 13818-6 type D, ISO/IEC 13818-1 auxiliary, andso on may be applied as the stream type. Meanwhile, according to theembodiment of the present invention, MPH video stream: Non-hierarchicalmode, MPH audio stream: Non-hierarchical mode, MPH Non-A/V stream:Non-hierarchical mode, MPH High Priority video stream: Hierarchicalmode, MPH High Priority audio stream: Hierarchical mode, MPH LowPriority video stream: Hierarchical mode, MPH Low priority audio stream:Hierarchical mode, and so on may further be applied as the stream type.

As described above, “MPH” corresponds to the initials of “mobile”,“pedestrian”, and “handheld” and represents the opposite concept of afixed-type system. Therefore, the MPH video stream: Non-hierarchicalmode, the MPH audio stream: Non-hierarchical mode, the MPH Non-A/Vstream: Non-hierarchical mode, the MPH High Priority video stream:Hierarchical mode, the MPH High Priority audio stream: Hierarchicalmode, the MPH Low Priority video stream: Hierarchical mode, and the MPHLow priority audio stream: Hierarchical mode correspond to stream typesthat are applied when mobile broadcast programs are being transmittedand received. Also the Hierarchical mode and the Non-hierarchical modeeach correspond to values that are used in stream types having differentpriority levels. Herein, the priority level is determined based upon ahierarchical structure applied in any one of the encoding or decodingmethod.

Therefore, when a hierarchical structure-type codec is used, a fieldvalue including the hierarchical mode and the non-hierarchical mode isrespectively designated so as to identify each stream. Such stream typeinformation is parsed by the SI and/or data decoder 6010, so as to beprovided to the video and audio decoders 6004 and 6005. Thereafter, eachof the video and audio decoders 6004 and 6005 uses the parsed streamtype information in order to perform the decoding process. Other streamtypes that may be applied in the present invention may include MPEG 4AUDIO, AC 3, AAC, AAC+, BSAC, HE AAC, AAC SBR, and MPEG-S for the audiodata, and may also include MPEG 2 VIDEO, MPEG 4 VIDEO, H.264, SVC, andVC-1 for the video data.

Furthermore, referring to FIG. 70, in fields using the hierarchical modeand the non-hierarchical mode, such as the MPH video stream:Non-hierarchical mode and the MPH audio stream: Non-hierarchical mode,examples of using the MPEG 4 AUDIO, AC 3, AAC, AAC+, BSAC, HE AAC, AACSBR, and MPEG-S for the audio data, and the MPEG 2 VIDEO, MPEG 4 VIDEO,H.264, SVC, and VC-1 for the video data may also be respectively used asreplacements for each of the audio stream and the video stream may beconsidered as other embodiments of the present invention and may,therefore, be included in the scope of the present invention. Meanwhile,the stream_type field may be provided as one of the fields within thePMT. And, in this case, it is apparent that such stream_type fieldincludes the above-described syntax. The STT transmits information onthe current data and timing information. The RRT transmits informationon region and consultation organs for program ratings. The ETT transmitsadditional description of a specific channel and broadcast program. TheEIT transmits information on virtual channel events (e.g., programtitle, program start time, etc.).

FIG. 71 illustrates a bit stream syntax for an event information table(EIT) according to the present invention. In this embodiment, the EITshown in FIG. 71 corresponds to a PSIP table including information on atitle, start time, duration, and so on of an event in a virtual channel.Referring to FIG. 71, the EIT is configured of a plurality of fieldsincluding a table_id field, a section_syntax_indicator field, aprivate_indicator field, a source_ID, a version_numbers_in_sectionfield, a current_next_indicator field, and a num_event field. Morespecifically, the table_id field is an 8-bit field having the value of‘oxCB’, which indicates that the corresponding section is included inthe EIT. The section_syntax_indicator field is a 1-bit field having thevalue of ‘1’. This indicates that the corresponding section passesthrough the section_length field and is in accordance with a genericsection syntax. The private_indicator field corresponds to a 1-bit fieldhaving the value of ‘1’.

Also, the source_ID corresponds to an ID identifying a virtual channelthat carries an event shown in the above-described table. Theversion_numbers_in_section field indicates the version of an elementincluded in the event information table. In the present invention, withrespect to the previous version number, an event change informationincluded in the event information table, wherein the event changeinformation has a new version number is recognized as the latest changein information. The current_next_indicator field indicates whether theevent information included in the corresponding EIT is a currentinformation or a next information. And, finally, the num_event fieldrepresents the number of events included in the channel having a sourceID. More specifically, an event loop shown below is repeated as manytimes as the number of events.

The above-described EIT field is commonly applied to at least one ormore events included in one EIT syntax. A loop statement, which isincluded as “for(j=0;j<num_event_in_section;j++){ }”, describes thecharacteristics of each event. The following fields represent detailedinformation of each individual event. Therefore, the following fieldsare individually applied to each corresponding event described by theEIT syntax. An event_ID included in an event loop is an identifier foridentifying each individual event. The number of the event IDcorresponds to a portion of the identifier for even extended textmessage (i.e., ETM_ID). A start_time field indicates the starting timeof an event. Therefore, the start_time field collects the starting timeinformation of a program provided from an electronic programinformation. A length_in_seconds field indicates the duration of anevent. Therefore, the length_in_seconds field collects the ending timeinformation of a program provided from an electronic programinformation. More specifically, the ending time information is collectedby adding the start_time field value and the length_in_seconds fieldvalue. A title_text( ) field may be used to indicate the tile of abroadcast program.

Meanwhile, the descriptor applied to each event may be included in theEIT. Herein, a descriptors_length field indicates the length of adescriptor. Also, a descriptor loop (i.e., descriptor{ }) included in a‘for’ loop repetition statement includes at least one of an AC-3 audiodescriptor, an MPEG 2 audio descriptor, an MPEG 4 audio descriptor, anAAC descriptor, an AAC+ descriptor, an HE AAC descriptor, an AAC SBRdescriptor, an MPEG surround descriptor, a BSAC descriptor, an MPEG 2video descriptor, an MPEG 4 video descriptor, an H.264 descriptor, anSVC descriptor, and a VC-1 descriptor. Herein, each descriptor describesinformation on audio/video codec applied to each event. Such codecinformation may be provided to the audio/video decoder 6004 and 6005 andused in the decoding process.

Finally, the DCCT/DCCSCT transmits information associated with automatic(or direct) channel change. And, the MGT transmits the versions and PIDinformation of the above-mentioned tables included in the PSIP. Each ofthe above-described tables included in the PSI/PSIP is configured of abasic unit referred to as a “section”, and a combination of one or moresections forms a table. For example, the VCT may be divided into 256sections. Herein, one section may include a plurality of virtual channelinformation. However, a single set of virtual channel information is notdivided into two or more sections. At this point, the receiving systemmay parse and decode the data for the data service that are transmittingby using only the tables included in the PSI, or only the tablesincluded in the PSIP, or a combination of tables included in both thePSI and the PSIP. In order to parse and decode the mobile service data,at least one of the PAT and PMT included in the PSI, and the VCTincluded in the PSIP is required. For example, the PAT may include thesystem information for transmitting the mobile service data, and the PIDof the PMT corresponding to the mobile service data (or program number).The PMT may include the PID of the TS packet used for transmitting themobile service data. The VCT may include information on the virtualchannel for transmitting the mobile service data, and the PID of the TSpacket for transmitting the mobile service data.

Meanwhile, depending upon the embodiment of the present invention, aDVB-SI may be applied instead of the PSIP. The DVB-SI may include anetwork information table (NIT), a service description table (SDT), anevent information table (EIT), and a time and data table (TDT). TheDVB-SI may be used in combination with the above-described PSI. Herein,the NIT divides the services corresponding to particular networkproviders by specific groups. The NIT includes all tuning informationthat are used during the IRD set-up. The NIT may be used for informingor notifying any change in the tuning information. The SDT includes theservice name and different parameters associated with each servicecorresponding to a particular MPEG multiplex. The EIT is used fortransmitting information associated with all events occurring in theMPEG multiplex. The EIT includes information on the current transmissionand also includes information selectively containing differenttransmission streams that may be received by the IRD. And, the TDT isused for updating the clock included in the IRD.

Furthermore, three selective SI tables (i.e., a bouquet associate table(BAT), a running status table (RST), and a stuffing table (ST)) may alsobe included. More specifically, the bouquet associate table (BAT)provides a service grouping method enabling the IRD to provide servicesto the viewers. Each specific service may belong to at least one‘bouquet’ unit. A running status table (RST) section is used forpromptly and instantly updating at least one event execution status. Theexecution status section is transmitted only once at the changing pointof the event status. Other SI tables are generally transmitted severaltimes. The stuffing table (ST) may be used for replacing or discarding asubsidiary table or the entire SI tables.

In the present invention, when the mobile service data correspond toaudio data and video data, it is preferable that the mobile service dataincluded (or loaded) in a payload within a TS packet correspond to PEStype mobile service data. According to another embodiment of the presentinvention, when the mobile service data correspond to the data for thedata service (or data service data), the mobile service data included inthe payload within the TS packet consist of a digital storagemedia-command and control (DSM-CC) section format. However, the TSpacket including the data service data may correspond either to apacketized elementary stream (PES) type or to a section type. Morespecifically, either the PES type data service data configure the TSpacket, or the section type data service data configure the TS packet.The TS packet configured of the section type data will be given as theexample of the present invention. At this point, the data service dataare includes in the digital storage media-command and control (DSM-CC)section. Herein, the DSM-CC section is then configured of a 188-byteunit TS packet.

Furthermore, the packet identification of the TS packet configuring theDSM-CC section is included in a data service table (DST). Whentransmitting the DST, ‘0x95’ is assigned as the value of a stream_typefield included in the service location descriptor of the PMT or the VCT.More specifically, when the PMT or VCT stream_type field value is‘0x95’, the receiving system may acknowledge the reception of the databroadcast program including mobile service data. At this point, themobile service data may be transmitted by a data/object carousel method.The data/object carousel method corresponds to repeatedly transmittingidentical data on a regular basis.

At this point, according to the control of the SI and/or data decoder6010, the demultiplexer 6003 performs section filtering, therebydiscarding repetitive sections and outputting only the non-repetitivesections to the SI and/or data decoder 6010. The demultiplexer 6003 mayalso output only the sections configuring desired tables (e.g., VCT orEIT) to the SI and/or data decoder 6010 by section filtering. Herein,the VCT or EIT may include a specific descriptor for the mobile servicedata. However, the present invention does not exclude the possibilitiesof the mobile service data being included in other tables, such as thePMT. The section filtering method may include a method of verifying thePID of a table defined by the MGT, such as the VCT, prior to performingthe section filtering process. Alternatively, the section filteringmethod may also include a method of directly performing the sectionfiltering process without verifying the MGT, when the VCT includes afixed PID (i.e., a base PID). At this point, the demultiplexer 6003performs the section filtering process by referring to a table_id field,a version_number field, a section_number field, etc.

As described above, the method of defining the PID of the VCT broadlyincludes two different methods. Herein, the PID of the VCT is a packetidentifier required for identifying the VCT from other tables. The firstmethod consists of setting the PID of the VCT so that it is dependent tothe MGT. In this case, the receiving system cannot directly verify theVCT among the many PSI and/or PSIP tables. Instead, the receiving systemmust check the PID defined in the MGT in order to read the VCT. Herein,the MGT defines the PID, size, version number, and so on, of diversetables. The second method consists of setting the PID of the VCT so thatthe PID is given a base PID value (or a fixed PID value), thereby beingindependent from the MGT. In this case, unlike in the first method, theVCT according to the present invention may be identified without havingto verify every single PID included in the MGT. Evidently, an agreementon the base PID must be previously made between the transmitting systemand the receiving system.

Meanwhile, in the embodiment of the present invention, the demultiplexer6003 may output only an application information table (AIT) to the SIand/or data decoder 6010 by section filtering. The AIT includesinformation on an application being operated in the receiver for thedata service. The AIT may also be referred to as an XAIT, and an AMT.Therefore, any table including application information may correspond tothe following description. When the AIT is transmitted, a value of‘0x05’ may be assigned to a stream_type field of the PMT. The AIT mayinclude application information, such as application name, applicationversion, application priority, application ID, application status (i.e.,auto-start, user-specific settings, kill, etc.), application type (i.e.,Java or HTML), position (or location) of stream including applicationclass and data files, application platform directory, and location ofapplication icon.

In the method for detecting application information for the data serviceby using the AIT, component_tag, original_network_id,transport_stream_id, and service_id fields may be used for detecting theapplication information. The component_tag field designates anelementary stream carrying a DSI of a corresponding object carousel. Theoriginal_network_id field indicates a DVB-SI original_network_id of theTS providing transport connection. The transport_stream_id fieldindicates the MPEG TS of the TS providing transport connection, and theservice_id field indicates the DVB-SI of the service providing transportconnection. Information on a specific channel may be obtained by usingthe original_network_id field, the transport_stream id field, and theservice_id field. The data service data, such as the application data,detected by using the above-described method may be stored in the secondmemory 6011 by the SI and/or data decoder 6010.

The SI and/or data decoder 6010 parses the DSM-CC section configuringthe demultiplexed mobile service data. Then, the mobile service datacorresponding to the parsed result are stored as a database in thesecond memory 6011. The SI and/or data decoder 6010 groups a pluralityof sections having the same table identification (table_id) so as toconfigure a table, which is then parsed. Thereafter, the parsed resultis stored as a database in the second memory 6011. At this point, byparsing data and/or sections, the SI and/or data decoder 6010 reads allof the remaining actual section data that are not section-filtered bythe demultiplexer 6003. Then, the SI and/or data decoder 6010 stores theread data to the second memory 6011. The second memory 6011 correspondsto a table and data/object carousel database storing system informationparsed from tables and mobile service data parsed from the DSM-CCsection. Herein, a table_id field, a section_number field, and alast_section_number field included in the table may be used to indicatewhether the corresponding table is configured of a single section or aplurality of sections. For example, TS packets having the PID of the VCTare grouped to form a section, and sections having table identifiersallocated to the VCT are grouped to form the VCT. When the VCT isparsed, information on the virtual channel to which mobile service dataare transmitted may be obtained.

Also, according to the present invention, the SI and/or data decoder6010 parses the SLD of the VCT, thereby transmitting the stream typeinformation of the corresponding elementary stream to the audio decoder6004 or the video decoder 6005. In this case, the corresponding audiodecoder 6004 or video decoder 6005 uses the transmitted stream typeinformation so as to perform the audio or video decoding process.Furthermore, according to the present invention, the SI and/or datadecoder 6010 parses an AC-3 audio descriptor, an MPEG 2 audiodescriptor, an MPEG 4 audio descriptor, an AAC descriptor, an AAC+descriptor, an HE AAC descriptor, an AAC SBR descriptor, an MPEGsurround descriptor, a BSAC descriptor, an MPEG 2 video descriptor, anMPEG 4 video descriptor, an H.264 descriptor, an SVC descriptor, a VC-1descriptor, and so on, of the EIT, thereby transmitting the audio orvideo codec information of the corresponding event to the audio decoder6004 or video decoder 6005. In this case, the corresponding audiodecoder 6004 or video decoder 6005 uses the transmitted audio or videocodec information in order to perform an audio or video decodingprocess.

The obtained application identification information, service componentidentification information, and service information corresponding to thedata service may either be stored in the second memory 6011 or beoutputted to the data broadcasting application manager 6013. Inaddition, reference may be made to the application identificationinformation, service component identification information, and serviceinformation in order to decode the data service data. Alternatively,such information may also prepare the operation of the applicationprogram for the data service. Furthermore, the SI and/or data decoder6010 controls the demultiplexing of the system information table, whichcorresponds to the information table associated with the channel andevents. Thereafter, an A/V PID list may be transmitted to the channelmanager 6007.

The channel manager 6007 may refer to the channel map 6008 in order totransmit a request for receiving system-related information data to theSI and/or data decoder 6010, thereby receiving the corresponding result.In addition, the channel manager 6007 may also control the channeltuning of the tuner 6001. Furthermore, the channel manager 6007 maydirectly control the demultiplexer 6003, so as to set up the A/V PID,thereby controlling the audio decoder 6004 and the video decoder 6005.

The audio decoder 6004 and the video decoder 6005 may respectivelydecode and output the audio data and video data demultiplexed from themain service data packet. Alternatively, the audio decoder 6004 and thevideo decoder 6005 may respectively decode and output the audio data andvideo data demultiplexed from the mobile service data packet. Meanwhile,when the mobile service data include data service data, and also audiodata and video data, it is apparent that the audio data and video datademultiplexed by the demultiplexer 6003 are respectively decoded by theaudio decoder 6004 and the video decoder 6005. For example, anaudio-coding (AC)-3 decoding algorithm, an MPEG-2 audio decodingalgorithm, an MPEG-4 audio decoding algorithm, an AAC decodingalgorithm, an AAC+ decoding algorithm, an HE AAC decoding algorithm, anAAC SBR decoding algorithm, an MPEG surround decoding algorithm, and aBSAC decoding algorithm may be applied to the audio decoder 6004. Also,an MPEG-2 video decoding algorithm, an MPEG-4 video decoding algorithm,an H.264 decoding algorithm, an SVC decoding algorithm, and a VC-1decoding algorithm may be applied to the video decoder 6005.Accordingly, the decoding process may be performed.

Meanwhile, the native TV application manager 6006 operates a nativeapplication program stored in the first memory 6009, thereby performinggeneral functions such as channel change. The native application programrefers to software stored in the receiving system upon shipping of theproduct. More specifically, when a user request (or command) istransmitted to the receiving system through a user interface (UI), thenative TV application manger 6006 displays the user request on a screenthrough a graphic user interface (GUI), thereby responding to the user'srequest. The user interface receives the user request through an inputdevice, such as a remote controller, a key pad, a jog controller, an atouch-screen provided on the screen, and then outputs the received userrequest to the native TV application manager 6006 and the databroadcasting application manager 6013. Furthermore, the native TVapplication manager 6006 controls the channel manager 6007, therebycontrolling channel-associated operations, such as the management of thechannel map 6008, and controlling the SI and/or data decoder 6010. Thenative TV application manager 6006 also controls the GUI of the overallreceiving system, thereby storing the user request and status of thereceiving system in the first memory 6009 and restoring the storedinformation.

The channel manager 6007 controls the tuner 6001 and the SI and/or datadecoder 6010, so as to managing the channel map 6008 so that it canrespond to the channel request made by the user. More specifically,channel manager 6007 sends a request to the SI and/or data decoder 6010so that the tables associated with the channels that are to be tuned areparsed. The results of the parsed tables are reported to the channelmanager 6007 by the SI and/or data decoder 6010. Thereafter, based onthe parsed results, the channel manager 6007 updates the channel map6008 and sets up a PID in the demultiplexer for demultiplexing thetables associated with the data service data from the mobile servicedata.

The system manager 6012 controls the booting of the receiving system byturning the power on or off. Then, the system manager 6012 stores ROMimages (including downloaded software images) in the first memory 6009.More specifically, the first memory 6009 stores management programs suchas operating system (OS) programs required for managing the receivingsystem and also application program executing data service functions.The application program is a program processing the data service datastored in the second memory so as to provide the user with the dataservice. If the data service data are stored in the second memory 6011,the corresponding data service data are processed by the above-describedapplication program or by other application programs, thereby beingprovided to the user. The management program and application programstored in the first memory may be updated or corrected to a newlydownloaded program. Furthermore, the storage of the stored managementprogram and application program is maintained without being deleted evenif the power of the system is shut down. Therefore, when the power issupplied, the programs may be executed without having to be newlydownloaded once again.

The application program for providing data service according to thepresent invention may either be initially stored in the first memory6009 upon the shipping of the receiving system, or be stored in thefirst memory 6009 after being downloaded. The application program forthe data service (i.e., the data service providing application program)stored in the first memory 6009 may also be deleted, updated, andcorrected. Furthermore, the data service providing application programmay be downloaded and executed along with the data service data eachtime the data service data are being received.

When a data service request is transmitted through the user interface,the data broadcasting application manager 6013 operates thecorresponding application program stored in the first memory 6009 so asto process the requested data, thereby providing the user with therequested data service. And, in order to provide such data service, thedata broadcasting application manager 6013 supports the graphic userinterface (GUI). Herein, the data service may be provided in the form oftext (or short message service (SMS)), voice message, still image, andmoving image. The data broadcasting application manager 6013 may beprovided with a platform for executing the application program stored inthe first memory 6009. The platform may be, for example, a Java virtualmachine for executing the Java program. Hereinafter, an example of thedata broadcasting application manager 6013 executing the data serviceproviding application program stored in the first memory 6009, so as toprocess the data service data stored in the second memory 6011, therebyproviding the user with the corresponding data service will now bedescribed in detail.

Assuming that the data service corresponds to a traffic informationservice, the data service according to the present invention is providedto the user of a receiver that is not equipped with an electronic mapand/or a GPS system in the form of at least one of a text (or shortmessage service (SMS)), a voice message, a graphic message, a stillimage, and a moving image. In this case, when a GPS module 6020 ismounted on the receiving system, as shown in FIG. 66, the GPS module6020 receives satellite signals transmitted from a plurality of lowearth orbit satellites and extracts the current position (or location)information (e.g., longitude, latitude, altitude), thereby outputtingthe extracted information to the data broadcasting application manager6013.

At this point, it is assumed that the electronic map includinginformation on each link and nod and other diverse graphic informationare stored in one of the second memory 6011, the first memory 6009, andanother memory that is not shown. More specifically, according to therequest made by the data broadcasting application manager 6013, the dataservice data stored in the second memory 6011 are read and inputted tothe data broadcasting application manager 6013. The data broadcastingapplication manager 6013 translates (or deciphers) the data service dataread from the second memory 6011, thereby extracting the necessaryinformation according to the contents of the message and/or a controlsignal. In other words, the data broadcasting application manager 6013uses the current position information and the graphic information, sothat the current position information can be processed and provided tothe user in a graphic format.

FIG. 72 illustrates a block diagram showing the structure of a digitalbroadcast (or television) receiving system according to anotherembodiment of the present invention. Referring to FIG. 72, the digitalbroadcast receiving system includes a tuner 7001, a demodulating unit7002, a demultiplexer 7003, a first descrambler 7004, an audio decoder7005, a video decoder 7006, a second descrambler 7007, an authenticationunit 7008, a native TV application manager 7009, a channel manager 7010,a channel map 7011, a first memory 7012, a data decoder 7013, a secondmemory 7014, a system manager 7015, a data broadcasting applicationmanager 7016, a storage controller 7017, a third memory 7018, atelecommunication module 7019, and a GPS module 7020. Herein, the thirdmemory 7018 is a mass storage device, such as a hard disk drive (HDD) ora memory chip. Also, during the description of the digital broadcast (ortelevision or DTV) receiving system shown in FIG. 72, the componentsthat are identical to those of the digital broadcast receiving system ofFIG. 66 will be omitted for simplicity.

As described above, in order to provide services for preventing illegalduplication (or copies) or illegal viewing of the enhanced data and/ormain data that are transmitted by using a broadcast network, and toprovide paid broadcast services, the transmitting system may generallyscramble and transmit the broadcast contents. Therefore, the receivingsystem needs to descramble the scrambled broadcast contents in order toprovide the user with the proper broadcast contents. Furthermore, thereceiving system may generally be processed with an authenticationprocess with an authentication means before the descrambling process.Hereinafter, the receiving system including an authentication means anda descrambling means according to an embodiment of the present inventionwill now be described in detail.

According to the present invention, the receiving system may be providedwith a descrambling means receiving scrambled broadcasting contents andan authentication means authenticating (or verifying) whether thereceiving system is entitled to receive the descrambled contents.Hereinafter, the descrambling means will be referred to as first andsecond descramblers 7004 and 7007, and the authentication means will bereferred to as an authentication unit 7008. Such naming of thecorresponding components is merely exemplary and is not limited to theterms suggested in the description of the present invention. Forexample, the units may also be referred to as a decryptor. Although FIG.72 illustrates an example of the descramblers 7004 and 7007 and theauthentication unit 7008 being provided inside the receiving system,each of the descramblers 7004 and 7007 and the authentication unit 7008may also be separately provided in an internal or external module.Herein, the module may include a slot type, such as a SD or CF memory, amemory stick type, a USB type, and so on, and may be detachably fixed tothe receiving system.

As described above, when the authentication process is performedsuccessfully by the authentication unit 7008, the scrambled broadcastingcontents are descrambled by the descramblers 7004 and 7007, therebybeing provided to the user. At this point, a variety of theauthentication method and descrambling method may be used herein.However, an agreement on each corresponding method should be madebetween the receiving system and the transmitting system. Hereinafter,the authentication and descrambling methods will now be described, andthe description of identical components or process steps will be omittedfor simplicity.

The receiving system including the authentication unit 7008 and thedescramblers 7004 and 7007 will now be described in detail. Thereceiving system receives the scrambled broadcasting contents throughthe tuner 7001 and the demodulating unit 7002. Then, the system manager7015 decides whether the received broadcasting contents have beenscrambled. Herein, the demodulating unit 7002 may be included as ademodulating means according to embodiment of the present invention asdescribed in FIG. 30 to FIG. 65. However, the present invention is notlimited to the examples given in the description set forth herein. Ifthe system manager 7015 decides that the received broadcasting contentshave been scrambled, then the system manager 7015 controls the system tooperate the authentication unit 7008. As described above, theauthentication unit 7008 performs an authentication process in order todecide whether the receiving system according to the present inventioncorresponds to a legitimate host entitled to receive the paidbroadcasting service. Herein, the authentication process may vary inaccordance with the authentication methods.

For example, the authentication unit 7008 may perform the authenticationprocess by comparing an IP address of an IP datagram within the receivedbroadcasting contents with a specific address of a corresponding host.At this point, the specific address of the corresponding receivingsystem (or host) may be a MAC address. More specifically, theauthentication unit 7008 may extract the IP address from thedecapsulated IP datagram, thereby obtaining the receiving systeminformation that is mapped with the IP address. At this point, thereceiving system should be provided, in advance, with information (e.g.,a table format) that can map the IP address and the receiving systeminformation. Accordingly, the authentication unit 7008 performs theauthentication process by determining the conformity between the addressof the corresponding receiving system and the system information of thereceiving system that is mapped with the IP address. In other words, ifthe authentication unit 7008 determines that the two types ofinformation conform to one another, then the authentication unit 7008determines that the receiving system is entitled to receive thecorresponding broadcasting contents.

In another example, standardized identification information is definedin advance by the receiving system and the transmitting system. Then,the identification information of the receiving system requesting thepaid broadcasting service is transmitted by the transmitting system.Thereafter, the receiving system determines whether the receivedidentification information conforms with its own unique identificationnumber, so as to perform the authentication process. More specifically,the transmitting system creates a database for storing theidentification information (or number) of the receiving systemrequesting the paid broadcasting service. Then, if the correspondingbroadcasting contents are scrambled, the transmitting system includesthe identification information in the EMM, which is then transmitted tothe receiving system.

If the corresponding broadcasting contents are scrambled, messages(e.g., entitlement control message (ECM), entitlement management message(EMM)), such as the CAS information, mode information, message positioninformation, that are applied to the scrambling of the broadcastingcontents are transmitted through a corresponding data header or anotherdata packet. The ECM may include a control word (CW) used for scramblingthe broadcasting contents. At this point, the control word may beencoded with an authentication key. The EMM may include anauthentication key and entitlement information of the correspondingdata. Herein, the authentication key may be encoded with a receivingsystem-specific distribution key. In other words, assuming that theenhanced data are scrambled by using the control word, and that theauthentication information and the descrambling information aretransmitted from the transmitting system, the transmitting systemencodes the CW with the authentication key and, then, includes theencoded CW in the entitlement control message (ECM), which is thentransmitted to the receiving system. Furthermore, the transmittingsystem includes the authentication key used for encoding the CW and theentitlement to receive data (or services) of the receiving system (i.e.,a standardized serial number of the receiving system that is entitled toreceive the corresponding broadcasting service or data) in theentitlement management message (EMM), which is then transmitted to thereceiving system.

Accordingly, the authentication unit 7008 of the receiving systemextracts the identification information of the receiving system and theidentification information included in the EMM of the broadcastingservice that is being received. Then, the authentication unit 7008determines whether the identification information conform to each other,so as to perform the authentication process. More specifically, if theauthentication unit 7008 determines that the information conform to eachother, then the authentication unit 7008 eventually determines that thereceiving system is entitled to receive the request broadcastingservice.

In yet another example, the authentication unit 7008 of the receivingsystem may be detachably fixed to an external module. In this case, thereceiving system is interfaced with the external module through a commoninterface (CI). In other words, the external module may receive the datascrambled by the receiving system through the common interface, therebyperforming the descrambling process of the received data. Alternatively,the external module may also transmit only the information required forthe descrambling process to the receiving system. The common interfaceis configured on a physical layer and at least one protocol layer.Herein, in consideration of any possible expansion of the protocol layerin a later process, the corresponding protocol layer may be configuredto have at least one layer that can each provide an independentfunction.

The external module may either consist of a memory or card havinginformation on the key used for the scrambling process and otherauthentication information but not including any descrambling function,or consist of a card having the above-mentioned key information andauthentication information and including the descrambling function. Boththe receiving system and the external module should be authenticated inorder to provide the user with the paid broadcasting service provided(or transmitted) from the transmitting system. Therefore, thetransmitting system can only provide the corresponding paid broadcastingservice to the authenticated pair of receiving system and externalmodule.

Additionally, an authentication process should also be performed betweenthe receiving system and the external module through the commoninterface. More specifically, the module may communicate with the systemmanager 7015 included in the receiving system through the commoninterface, thereby authenticating the receiving system. Alternatively,the receiving system may authenticate the module through the commoninterface. Furthermore, during the authentication process, the modulemay extract the unique ID of the receiving system and its own unique IDand transmit the extracted IDs to the transmitting system. Thus, thetransmitting system may use the transmitted ID values as informationdetermining whether to start the requested service or as paymentinformation. Whenever necessary, the system manager 7015 transmits thepayment information to the remote transmitting system through thetelecommunication module 7019.

The authentication unit 7008 authenticates the corresponding receivingsystem and/or the external module. Then, if the authentication processis successfully completed, the authentication unit 7008 certifies thecorresponding receiving system and/or the external module as alegitimate system and/or module entitled to receive the requested paidbroadcasting service. In addition, the authentication unit 7008 may alsoreceive authentication-associated information from a mobiletelecommunications service provider to which the user of the receivingsystem is subscribed, instead of the transmitting system providing therequested broadcasting service. In this case, theauthentication-association information may either be scrambled by thetransmitting system providing the broadcasting service and, then,transmitted to the user through the mobile telecommunications serviceprovider, or be directly scrambled and transmitted by the mobiletelecommunications service provider. Once the authentication process issuccessfully completed by the authentication unit 7008, the receivingsystem may descramble the scrambled broadcasting contents received fromthe transmitting system. At this point, the descrambling process isperformed by the first and second descramblers 7004 and 7007. Herein,the first and second descramblers 7004 and 7007 may be included in aninternal module or an external module of the receiving system.

The receiving system is also provided with a common interface forcommunicating with the external module including the first and seconddescramblers 7004 and 7007, so as to perform the descrambling process.More specifically, the first and second descramblers 7004 and 7007 maybe included in the module or in the receiving system in the form ofhardware, middleware or software. Herein, the descramblers 7004 and 7007may be included in any one of or both of the module and the receivingsystem. If the first and second descramblers 7004 and 7007 are providedinside the receiving system, it is advantageous to have the transmittingsystem (i.e., at least any one of a service provider and a broadcaststation) scramble the corresponding data using the same scramblingmethod.

Alternatively, if the first and second descramblers 7004 and 7007 areprovided in the external module, it is advantageous to have eachtransmitting system scramble the corresponding data using differentscrambling methods. In this case, the receiving system is not requiredto be provided with the descrambling algorithm corresponding to eachtransmitting system. Therefore, the structure and size of receivingsystem may be simplified and more compact. Accordingly, in this case,the external module itself may be able to provide CA functions, whichare uniquely and only provided by each transmitting systems, andfunctions related to each service that is to be provided to the user.The common interface enables the various external modules and the systemmanager 7015, which is included in the receiving system, to communicatewith one another by a single communication method. Furthermore, sincethe receiving system may be operated by being connected with at leastone or more modules providing different services, the receiving systemmay be connected to a plurality of modules and controllers.

In order to maintain successful communication between the receivingsystem and the external module, the common interface protocol includes afunction of periodically checking the status of the oppositecorrespondent. By using this function, the receiving system and theexternal module is capable of managing the status of each oppositecorrespondent. This function also reports the user or the transmittingsystem of any malfunction that may occur in any one of the receivingsystem and the external module and attempts the recovery of themalfunction.

In yet another example, the authentication process may be performedthrough software. More specifically, when a memory card having CASsoftware downloaded, for example, and stored therein in advanced isinserted in the receiving system, the receiving system receives andloads the CAS software from the memory card so as to perform theauthentication process. In this example, the CAS software is read outfrom the memory card and stored in the first memory 7012 of thereceiving system. Thereafter, the CAS software is operated in thereceiving system as an application program. According to an embodimentof the present invention, the CAS software is mounted on (or stored) ina middleware platform and, then executed. A Java middleware will begiven as an example of the middleware included in the present invention.Herein, the CAS software should at least include information requiredfor the authentication process and also information required for thedescrambling process.

Therefore, the authentication unit 7008 performs authenticationprocesses between the transmitting system and the receiving system andalso between the receiving system and the memory card. At this point, asdescribed above, the memory card should be entitled to receive thecorresponding data and should include information on a normal receivingsystem that can be authenticated. For example, information on thereceiving system may include a unique number, such as a standardizedserial number of the corresponding receiving system. Accordingly, theauthentication unit 7008 compares the standardized serial numberincluded in the memory card with the unique information of the receivingsystem, thereby performing the authentication process between thereceiving system and the memory card.

If the CAS software is first executed in the Java middleware base, thenthe authentication between the receiving system and the memory card isperformed. For example, when the unique number of the receiving systemstored in the memory card conforms to the unique number of the receivingsystem read from the system manager 7015, then the memory card isverified and determined to be a normal memory card that may be used inthe receiving system. At this point, the CAS software may either beinstalled in the first memory 7012 upon the shipping of the presentinvention, or be downloaded to the first memory 7012 from thetransmitting system or the module or memory card, as described above.Herein, the descrambling function may be operated by the databroadcasting application manger 7016 as an application program.

Thereafter, the CAS software parses the EMM/ECM packets outputted fromthe demultiplexer 7003, so as to verify whether the receiving system isentitled to receive the corresponding data, thereby obtaining theinformation required for descrambling (i.e., the CW) and providing theobtained CW to the descramblers 7004 and 7007. More specifically, theCAS software operating in the Java middleware platform first reads outthe unique (or serial) number of the receiving system from thecorresponding receiving system and compares it with the unique number ofthe receiving system transmitted through the EMM, thereby verifyingwhether the receiving system is entitled to receive the correspondingdata. Once the receiving entitlement of the receiving system isverified, the corresponding broadcasting service information transmittedto the ECM and the entitlement of receiving the correspondingbroadcasting service are used to verify whether the receiving system isentitled to receive the corresponding broadcasting service. Once thereceiving system is verified to be entitled to receive the correspondingbroadcasting service, the authentication key transmitted to the EMM isused to decode (or decipher) the encoded CW, which is transmitted to theECM, thereby transmitting the decoded CW to the descramblers 7004 and7007. Each of the descramblers 7004 and 7007 uses the CW to descramblethe broadcasting service.

Meanwhile, the CAS software stored in the memory card may be expanded inaccordance with the paid service which the broadcast station is toprovide. Additionally, the CAS software may also include otheradditional information other than the information associated with theauthentication and descrambling. Furthermore, the receiving system maydownload the CAS software from the transmitting system so as to upgrade(or update) the CAS software originally stored in the memory card. Asdescribed above, regardless of the type of broadcast receiving system,as long as an external memory interface is provided, the presentinvention may embody a CAS system that can meet the requirements of alltypes of memory card that may be detachably fixed to the receivingsystem. Thus, the present invention may realize maximum performance ofthe receiving system with minimum fabrication cost, wherein thereceiving system may receive paid broadcasting contents such asbroadcast programs, thereby acknowledging and regarding the variety ofthe receiving system. Moreover, since only the minimum applicationprogram interface is required to be embodied in the embodiment of thepresent invention, the fabrication cost may be minimized, therebyeliminating the manufacturer's dependence on CAS manufacturers.Accordingly, fabrication costs of CAS equipments and management systemsmay also be minimized.

Meanwhile, the descramblers 7004 and 7007 may be included in the moduleeither in the form of hardware or in the form of software. In this case,the scrambled data that being received are descrambled by the module andthen demodulated. Also, if the scrambled data that are being receivedare stored in the third memory 7018, the received data may bedescrambled and then stored, or stored in the memory at the point ofbeing received and then descrambled later on prior to being played (orreproduced). Thereafter, in case scramble/descramble algorithms areprovided in the storage controller 7017, the storage controller 7017scrambles the data that are being received once again and then storesthe re-scrambled data to the third memory 7018.

In yet another example, the descrambled broadcasting contents(transmission of which being restricted) are transmitted through thebroadcasting network. Also, information associated with theauthentication and descrambling of data in order to disable thereceiving restrictions of the corresponding data are transmitted and/orreceived through the telecommunications module 7019. Thus, the receivingsystem is able to perform reciprocal (or two-way) communication. Thereceiving system may either transmit data to the telecommunicationmodule within the transmitting system or be provided with the data fromthe telecommunication module within the transmitting system. Herein, thedata correspond to broadcasting data that are desired to be transmittedto or from the transmitting system, and also unique information (i.e.,identification information) such as a serial number of the receivingsystem or MAC address.

The telecommunication module 7019 included in the receiving systemprovides a protocol required for performing reciprocal (or two-way)communication between the receiving system, which does not support thereciprocal communication function, and the telecommunication moduleincluded in the transmitting system. Furthermore, the receiving systemconfigures a protocol data unit (PDU) using a tag-length-value (TLV)coding method including the data that are to be transmitted and theunique information (or ID information). Herein, the tag field includesindexing of the corresponding PDU. The length field includes the lengthof the value field. And, the value field includes the actual data thatare to be transmitted and the unique number (e.g., identificationnumber) of the receiving system.

The receiving system may configure a platform that is equipped with theJava platform and that is operated after downloading the Javaapplication of the transmitting system to the receiving system throughthe network. In this case, a structure of downloading the PDU includingthe tag field arbitrarily defined by the transmitting system from astorage means included in the receiving system and then transmitting thedownloaded PDU to the telecommunication module 7019 may also beconfigured. Also, the PDU may be configured in the Java application ofthe receiving system and then outputted to the telecommunication module7019. The PDU may also be configured by transmitting the tag value, theactual data that are to be transmitted, the unique information of thecorresponding receiving system from the Java application and byperforming the TLV coding process in the receiving system. Thisstructure is advantageous in that the firmware of the receiving systemis not required to be changed even if the data (or application) desiredby the transmitting system is added.

The telecommunication module within the transmitting system eithertransmits the PDU received from the receiving system through a wirelessdata network or configures the data received through the network into aPDU which is transmitted to the host. At this point, when configuringthe PDU that is to be transmitted to the host, the telecommunicationmodule within the transmitting end may include unique information (e.g.,IP address) of the transmitting system which is located in a remotelocation. Additionally, in receiving and transmitting data through thewireless data network, the receiving system may be provided with acommon interface, and also provided with a WAP, CDMA 1× EV-DO, which canbe connected through a mobile telecommunication base station, such asCDMA and GSM, and also provided with a wireless LAN, mobile internet,WiBro, WiMax, which can be connected through an access point. Theabove-described receiving system corresponds to the system that is notequipped with a telecommunication function. However, a receiving systemequipped with telecommunication function does not require thetelecommunication module 7019.

The broadcasting data being transmitted and received through theabove-described wireless data network may include data required forperforming the function of limiting data reception. Meanwhile, thedemultiplexer 7003 receives either the real-time data outputted from thedemodulating unit 7002 or the data read from the third memory 7018,thereby performing demultiplexing. In this embodiment of the presentinvention, the demultiplexer 7003 performs demultiplexing on theenhanced data packet. Similar process steps have already been describedearlier in the description of the present invention. Therefore, adetailed of the process of demultiplexing the enhanced data will beomitted for simplicity.

The first descrambler 7004 receives the demultiplexed signals from thedemultiplexer 7003 and then descrambles the received signals. At thispoint, the first descrambler 7004 may receive the authentication resultreceived from the authentication unit 7008 and other data required forthe descrambling process, so as to perform the descrambling process. Theaudio decoder 7005 and the video decoder 7006 receive the signalsdescrambled by the first descrambler 7004, which are then decoded andoutputted. Alternatively, if the first descrambler 7004 did not performthe descrambling process, then the audio decoder 7005 and the videodecoder 7006 directly decode and output the received signals. In thiscase, the decoded signals are received and then descrambled by thesecond descrambler 7007 and processed accordingly.

Although the preferred embodiments of the present invention have beendisclosed for illustrative purposes, those skilled in the art willappreciate that various modifications, additions and substitutions arepossible, without departing from the scope and spirit of the inventionas disclosed in the accompanying claims.

EFFECT OF THE INVENTION

As described above, the digital broadcasting system and data processingmethod according to the present invention are robust against (orresistant to) any error that may occur when transmitting mobile servicedata through a channel. And, the present invention is also highlycompatible to the conventional system.

Moreover, the present invention may also receive the mobile service datawithout any error even in channels having severe ghost effect and noise.

By inserting known data in specific positions (or places) within a dataregion, the present invention may enhance the receiving performance ofthe receiving system in an environment undergoing frequent channelchanges.

Additionally, when multiplexing the mobile service data with the mainservice data, by multiplexing the data in a burst structure, the powerconsumption level of the receiving system may be reduced.

Finally, the present invention is even more effective when applied tomobile and portable receivers, which are also liable to a frequentchange in channel and which require protection (or resistance) againstintense noise.

It will be apparent to those skilled in the art that variousmodifications and variations can be made in the present inventionwithout departing from the spirit or scope of the inventions. Thus, itis intended that the present invention covers the modifications andvariations of this invention provided they come within the scope of theappended claims and their equivalents.

1. A method for controlling mobile service data comprising: a) receivingmobile service data; b) demodulating the received mobile service data;c) storing the demodulated mobile service data, and performing atime-shift playback of the stored mobile service data.
 2. The methodaccording to claim 1, wherein the receiving step a) of the mobileservice data is implemented by selective reception of multiplexed mainservice data and mobile service data.
 3. The method according to claim2, wherein the selective reception includes the steps: receiving themobile service data from a burst-on section, on the basis of the mobileservice data and the main service data which have been multiplexed in aburst structure including the burst-on section and a burst-off section,wherein the mobile service data is further coded as compared to the mainservice data.
 4. The method according to claim 1, wherein the receivingstep a) of the mobile service data includes: receiving a data groupincluding at least one mobile service data packet.
 5. The methodaccording to claim 4, wherein the data group includes known data in apredetermined data region.
 6. The method according to claim 5, whereinthe demodulating step b) of the received mobile service data includes:performing at least one of carrier recovery, timing recovery, andchannel equalization on the received mobile service data using the knowndata.
 7. The method according to claim 1, the time-shift step c) of thedemodulated mobile service data includes: entering a time-shift modeselection signal; setting a time-shift storage area when the time-shiftmode selection signal is entered; storing the demodulated mobile servicedata in the time-shift storage area; and reproducing the stored mobileservice data from a predetermined position of the time-shift storagearea.
 8. The method according to claim 7, further comprising: displayingtime-shifted mobile service program and the currently received livemobile service program, simultaneously.
 9. The method according to claim7, further comprising: deleting from the oldest data among the mobileservice data stored in the time-shift storage area, when the time-shiftstorage area is full.
 10. The method according to claim 7, wherein thetime-shift storage area is allocated additionally by user's selection.11. The method according to claim 10, wherein the allocating unit of thetime-shift storage area is at least one of time, capacity, andpercentage.
 12. An apparatus for receiving mobile service datacomprising: a signal receiving unit for receiving mobile service data; ademodulating unit for demodulating the received mobile service data; anda controller for storing the demodulated mobile service data, andperforming a time-shift playback of the stored mobile service data. 13.The apparatus according to claim 12, wherein the signal receiving unitreceives the mobile service data from a burst-on section, on the basisof the mobile service data and the main service data which have beenmultiplexed in a burst structure including the burst-on section and aburst-off section, wherein the mobile service data is further coded ascompared to the main service data.
 14. The apparatus according to claim12, wherein the signal receiving unit receives a data group including atleast one mobile service data packet.
 15. The apparatus according toclaim 14, wherein the data group includes known data in a predetermineddata region.
 16. The apparatus according to claim 15, wherein thedemodulating unit performs at least one of carrier recovery, timingrecovery, and channel equalization on the received mobile service datausing the known data.
 17. The apparatus according to claim 12, furthercomprising: a peripheral-device connection interface for storing themobile service data in a external storage medium upon receiving acontrol signal from the controller, and is connected to the externalstorage medium.
 18. The apparatus according to claim 12, wherein thecontroller sets a time-shift storage area when a time-shift modeselection signal is entered, stores the demodulated mobile service datain the time-shift storage area, and reproduces the stored mobile servicedata from a predetermined position of the time-shift storage area. 19.The apparatus according to claim 12, wherein the controller displaystime-shifted mobile service program and the currently received livemobile service program, simultaneously.
 10. The apparatus according toclaim 12, wherein the controller deletes from the oldest data among themobile service data stored in the time-shift storage area when thetime-shift storage area is full.
 21. The apparatus according to claim20, wherein the time-shift storage area is allocated additionally byuser's selection.
 22. The apparatus according to claim 20, wherein theallocating unit of the time-shift storage area is at least one of time,capacity, and percentage.
 23. The apparatus according to claim 12,wherein the controller displays a progress-status indication OSD,wherein playback of the stored mobile service data is controlled on theprogress-status indication OSD.